The complexity of uniform Nash equilibria and related regular subgraph problems

Theoretical Computer Science

Volumn 401, Issue 1-3, 2008, Pages 144-152

  Bonifaci, Vincenzo ^a,b   Iorio, Ugo Di ^b   Laura, Luigi ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Computational complexity; NP completeness; Regular induced subgraph; Uniform Nash equilibrium

Indexed keywords

NUCLEAR PROPULSION;

(ALGORITHMIC) COMPLEXITY; (LIQUID + LIQUID) EQUILIBRIUM; BIMATRIX GAMES; ELSEVIER (CO); INDUCED SUBGRAPHS; LARGE SIZES; NASH EQUILIBRIUM (NE); NP COMPLETE PROBLEMS; NP COMPLETENESS; SUBGRAPH PROBLEMS;

TELECOMMUNICATION NETWORKS;

EID: 45049087867     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.03.036     Document Type: Article

References (23)

1. T. Abbott, D. Kane, P. Valiant, On the complexity of two-player win-lose games, in: Proc. 46th Symp. on Foundations of Computer Science, 2005, pp. 113-122
2. Addario-Berry L., Olver N., and Vetta A. A polynomial time algorithm for finding Nash equilibria in planar win-lose games. Journal of Graph Algorithms and Applications 11 1 (2007) 309-319
3. V. Bonifaci, U.D. Iorio, L. Laura, New results on the complexity of uniformly mixed Nash equilibria, in: Proc. 1st Workshop on Internet and Network Economics, 2005, pp. 1023-1032
4. V. Bonifaci, U.D. Iorio, L. Laura, On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems, in: Proc. 15th Symp. on Fundamentals of Computation Theory, 2005, pp. 197-208
5. Cardoso D.M., Kaminski M., and Lozin V. Maximum k-regular induced subgraphs. Journal of Combinatorial Optimization 14 (2007) 455-463
6. X. Chen, X. Deng, Settling the complexity of two-player Nash equilibrium, in: Proc. 47th Symp. on Foundations of Computer Science, 2006, pp. 261-272
7. B. Codenotti, M. Leoncini, G. Resta, Efficient computation of Nash equilibria for very sparse win-lose bimatrix games, in: Proc. 14th European Symp. on Algorithms, 2006, pp. 232-243
8. Codenotti B., and Stefankovic D. On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Information Processing Letters 94 3 (2005) 145-150
9. V. Conitzer, T. Sandholm, Complexity results about Nash equilibria, in: Proc. 18th Int. Joint Conf. on Artificial Intelligence, 2003, pp. 765-771
10. C. Daskalakis, P.W. Goldberg, C.H. Papadimitriou, The complexity of computing a Nash equilibrium, in: Proc. 38th Symp. on Theory of Computing, 2006, pp. 71-78
11. A. Fabrikant, C.H. Papadimitriou, K. Talwar, The complexity of pure Nash equilibria, in: Proc. 36th Symp. on Theory of Computing, 2004, pp. 604-612
12. Gilboa I., and Zemel E. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1 1 (1989) 80-93
13. P.W. Goldberg, C.H. Papadimitriou, Reducibility among equilibrium problems, in: Proc. 38th Symp. on Theory of Computing, 2006, pp. 61-70
14. G. Gottlob, G. Greco, F. Scarcello, Pure Nash equilibria: Hard and easy games, in: Proc. 9th Conf. on Theoretical Aspects of Rationality and Knowledge, 2003, pp. 215-230
15. S. Gupta, V. Raman, S. Saurabh, Fast exponential algorithms for maximum r-regular induced subgraph problems, in: Proc. 26th Foundations of Software Technology and Theoretical Computer Science, 2006, pp. 139-151
16. J.M. Lewis, On the complexity of the maximum subgraph problem, in: Proc. 10th Symp. on Theory of Computing, 1978, pp. 265-274
17. R.J. Lipton, E. Markakis, A. Mehta, Playing large games using simple strategies, in: Proc. 4th Conf. on Electronic Commerce, 2003, pp. 36-41
18. M. Mavronicolas, V.G. Papadopoulou, A. Phillippou, P.G. Spirakis, Network game with attacker and protector entities, in: Proc. 16th Int. Symp. on Algorithms and Computation, 2005, pp. 288-297
19. Papadimitriou C.H. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and Systems Sciences 48 3 (1994) 498-532
20. C.H. Papadimitriou, Computing correlated equilibria in multi-player games, in: Proc. 37th Symp. on Theory of Computing, 2005, pp. 49-56
21. Rubinstein A. Modeling Bounded Rationality (1998), MIT Press, Cambridge
22. R. Savani, B. von Stengel, Exponentially many steps for finding a Nash equilibrium in a bimatrix game, in: Proc. 45th Symp. on Foundations of Computer Science, 2004, pp. 258-267
23. M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. 10th Symp. on Theory of Computing, 1978, pp. 253-264