Abstract
In a recent paper [Int J Game Theory (2001) 30:99–106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.
Original language | English |
---|---|
Pages (from-to) | 183-189 |
Number of pages | 7 |
Journal | Mathematical methods of operations research |
Volume | 58 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2003 |
Keywords
- Computational Complexity
- Games
- IR-58666
- METIS-213319
- common payoffs