| Article ID: | iaor20051015 |
| Country: | Germany |
| Volume: | 58 |
| Issue: | 2 |
| Start Page Number: | 183 |
| End Page Number: | 189 |
| Publication Date: | Jan 2003 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Woeginger Gerhard J. |
In a recent paper, 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.