On the NP-completeness of finding an optimal strategy in games with common payoffs

International Journal of Game Theory

Volumn 30, Issue 1, 2001, Pages 99-106

  Chu, Francis ^a   Halpern, Joseph ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035538783     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001820100066     Document Type: Article

References (5)

1. Garey M, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. San Francisco. Calif.: W. Freeman and Co
2. Gilboa I, Zemel E (1989) Nash and correlated equilibrium: some complexity considerations. Games and Economic Behavior 1:80-93
3. Hogg T, Huberman B, Williams C (Eds.) (1996) Artificial intelligence. Volume 81. Elsevier. Special Issue on Phase Transitions and Complexity
4. Koller D, Megiddo N (1992) The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4(4):528-552
5. Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L (1999) Typical-case complexity results from a new type of phase transition. Nature 400(8):133-137