Skip to main content
Springer Nature Link
Log in

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

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Twente, P.O. Box 217, 7500, AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Authors
  1. Gerhard J. Woeginger
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Gerhard J. Woeginger.

Additional information

Acknowledgement. I thank the referee for a very careful reading of the paper, and for pointing out to me a number of typos and inconsistencies in an earlier version of the paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Woeginger, G. A note on the complexity of determining optimal strategies in games with common payoffs. Math Meth Oper Res 58, 183–189 (2003). https://doi.org/10.1007/s001860300300

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860300300

Keywords