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

Gerhard J. Woeginger ()

Mathematical Methods of Operations Research, 2003, vol. 58, issue 2, 183-189

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. Copyright Springer-Verlag 2003

Keywords: Games; computational complexity; common payoffs (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300300 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:58:y:2003:i:2:p:183-189

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300300

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().