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

Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)183-189
Number of pages7
JournalMathematical methods of operations research
Volume58
Issue number2
DOIs
Publication statusPublished - 2003

Keywords

  • Computational Complexity
  • Games
  • IR-58666
  • METIS-213319
  • common payoffs

Fingerprint Dive into the research topics of 'A note on the complexity of determining optimal strategies in games with common payoffs'. Together they form a unique fingerprint.

Cite this