A note on the complexity of determining optimal strategies in games with common payoffs

Woeginger, Gerhard J. (2003) A note on the complexity of determining optimal strategies in games with common payoffs. Mathematical methods of operations research, 58 (2). pp. 183-189. ISSN 1432-2994

PDF
Restricted to UT campus only: Request a copy
253Kb

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.
Item Type:	Article
Copyright:	© 2003 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/58666
Official URL:	http://dx.doi.org/10.1007/s001860300300
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 213319