IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-02094375.html
   My bibliography  Save this paper

Computing approximate pure Nash equilibria in congestion games

Author

Listed:
  • Ioannis Caragiannis

    (CTI - Computer Technology Institute - Computer Technology Institute)

  • Angelo Fanelli

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique, C2I - Centre for Computational Intelligence [Nanyang] - NTU - Nanyang Technological University [Singapour])

  • Nick Gravin

    (C2I - Centre for Computational Intelligence [Nanyang] - NTU - Nanyang Technological University [Singapour])

  • Alexander Skopalik

    (TU Dortmund University, Germany)

Abstract

Among other solution concepts, the notion of the pure Nash equilibrium plays a central role in Game Theory. Pure Nash equilibria in a game characterize situations with non-cooperative deterministic players in which no player has any incentive to unilaterally deviate from the current situation in order to achieve a higher payoff. Unfortunately, it is well known that there are games that do not have pure Nash equilibria. Furhermore, even in games where the existence of equilibria is guaranteed, their computation can be a computationally hard task. Such negative results significantly question the importance of pure Nash equilibria as solution concepts that characterize the behavior of rational players. Approximate pure Nash equilibria, which characterize situations where no player can significantly improve her payoff by unilaterally deviating from her current strategy, could serve as alternative solution concepts provided that they exist and can be computed efficiently. In this letter, we discuss recent positive algorithmic results for approximate pure Nash equilibria in congestion games.

Suggested Citation

  • Ioannis Caragiannis & Angelo Fanelli & Nick Gravin & Alexander Skopalik, 2012. "Computing approximate pure Nash equilibria in congestion games," Post-Print halshs-02094375, HAL.
    • Handle: RePEc:hal:journl:halshs-02094375
    DOI: 10.1145/2325713.2325718
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Vittorio Bilò & Mauro Paladini, 2016. "On the performance of mildly greedy players in cut games," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1036-1051, November.
    2. Daskalakis, Constantinos & Papadimitriou, Christos H., 2015. "Approximate Nash equilibria in anonymous games," Journal of Economic Theory, Elsevier, vol. 156(C), pages 207-245.

    More about this item

    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:hal:journl:halshs-02094375. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.