Equilibria of graphical games with symmetries (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5385 LNCS, Issue , 2008, Pages 198-209

  Brandt, Felix ^a   Fischer, Felix ^a   Holzer, Markus ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; OPTICAL COMMUNICATION; POLYNOMIAL APPROXIMATION; WINE;

EQUILIBRIUM PROBLEMS; EVEN CYCLES; EXTENDED ABSTRACTS; NASH EQUILIBRIUM; NEIGHBORHOOD GRAPHS; NP-HARD; PAYOFF FUNCTIONS; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS;

GAME THEORY;

EID: 58849145149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_27     Document Type: Conference Paper

References (20)

1. Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure Nash equilibrium. Journal of Computer and System Sciences (to appear, 2008)
2. Daskalakis, C., Papadimitriou, C.H.: The complexity of games on highly regular graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 71-82. Springer, Heidelberg (2005)
3. Daskalakis, C., Papadimitriou, C.H.: Computing equilibria in anonymous games. In: Proc. of 48th FOCS Symposium, pp. 83-93. IEEE Press, Los Alamitos (2007)
4. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proc. of 38th STOC, pp. 71-78. ACM Press, New York (2006)
5. Elkind, E., Goldberg, L.A., Goldberg, P.W.: Equilibria in graphical games on trees revisited. In: Proc. of 7th ACM-EC Conference, pp. 100-109. ACM Press, New York (2006)
6. Elkind, E., Goldberg, L.A., Goldberg, P.W.: Computing good Nash equilibria in graphical games. In: Proc. of 8th ACM-EC Conference, pp. 162-171. ACM Press, New York (2007)
7. Fischer, F., Holzer, M., Katzenbeisser, S.: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Information Processing Letters 99(6), 239-245 (2006)
8. Goldberg, P.W., Papadimitriou, C.H.: Reducibility among equilibrium problems. In: Proc. of 38th STOC, pp. 61-70. ACM Press, New York (2006)
9. Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: Hard and easy games. Journal of Artificial Intelligence Research 24, 195-220 (2005)
10. Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: Proc. of 17th UAI Conference, pp. 253-260. Morgan Kaufmann, San Francisco (2001)
11. Luce, R.D., Raiffa, H.: Games and Decisions: Introduction and Critical Survey. John Wiley & Sons Inc., Chichester (1957)
12. Nash, J.F.: Non-cooperative games. Annals of Mathematics 54(2), 286-295 (1951)
13. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
14. Papadimitriou, C.H., Roughgarden, T.: Computing equilibria in multi-player games. In: Proc. of 16th SODA, pp. 82-91. SIAM, Philadelphia (2005)
15. Parikh, R.: On context-free languages. Journal of the ACM 13(4), 570-581 (1966)
16. Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Annals of Mathematics 150, 929-975 (1999)
17. Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of 10th STOC, pp. 216-226. ACM Press, New York (1978)
18. Schoenebeck, G., Vadhan, S.: The computational complexity of Nash equilibria in concisely represented games. In: Proc. of 7th ACM-EC Conference, pp. 270-279. ACM Press, New York (2006)
19. Seymour, P.D.: On the two-colouring of hypergraphs. The Quarterly Journal of Mathematics 25, 303-312 (1974)
20. Thomassen, C.: Even cycles in directed graphs. European Journal of Combinatorics 6, 85-89 (1985)