IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v23y2004i2p445-454.html
   My bibliography  Save this article

Finding a Nash equilibrium in spatial games is an NP-complete problem

Author

Listed:
  • Richard Baron
  • Jacques Durieu
  • Hans Haller
  • Philippe Solal

Abstract

We consider the class of (finite) spatial games. We show that the problem of determining whether there exists a Nash equilibrium in which each player has a payoff of at least k is NP-complete as a function of the number of players. Copyright Springer-Verlag Berlin/Heidelberg 2004

Suggested Citation

  • Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(2), pages 445-454, January.
    • Handle: RePEc:spr:joecth:v:23:y:2004:i:2:p:445-454
    DOI: 10.1007/s00199-003-0376-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-003-0376-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-003-0376-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. R. S. Bartholo & C. A. Cosenza & F. A. Doria & M. Doria & A. Teixeira, 2011. "On Exact and Approximate Solutions for Hard Problems: An Alternative Look," ASSRU Discussion Papers 1103, ASSRU - Algorithmic Social Science Research Unit.
    2. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.

    More about this item

    Keywords

    Spatial games; NP-completeness; Graph k-colorability.;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:23:y:2004:i:2:p:445-454. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.