NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games

Abstract : We apply systematically a framework to settle the NP-hardness of some properties related to pure Nash equilibrium in Scheduling and Network Design Games. The technique is simple: first, we construct a gadget without a desired property and then embed it into a larger game which encodes a NP-hard problem in order to prove the complexity of the desired property in a game. This technique is very efficient in proving NP-hardness of the existence of a Nash equilibrium. In the paper, we illustrate the efficiency of the technique in proving the NP-hardness of the existence of a pure Nash equilibrium in Matrix Scheduling Games and Weighted Network Design Games. Moreover, using the technique, we can settle not only the complexity of the equilibrium existence but also that of the existence of good cost-sharing protocol.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00819104
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, April 30, 2013 - 10:12:40 AM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Links full text

Identifiers

Collections

Citation

Kim Thang Nguyen. NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games. Theoretical Computer Science, Elsevier, 2013, 482 (22), pp.86--95. ⟨10.1016/j.tcs.2012.10.051⟩. ⟨hal-00819104⟩

Share

Metrics

Record views

104