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

A formula for Nash equilibria in monotone singleton congestion games

Author

Listed:
  • Samir Sbabou

    (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)

  • Hatem Smaoui

    (CEMOI - Centre d'Économie et de Management de l'Océan Indien - UR - Université de La Réunion)

  • Abderrahmane Ziad

    (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)

Abstract

This paper provides a simple formula describing all Nash equilibria in monotone symmetric singleton congestion games. Our approach also yields a new and short proof establishing the existence of a Nash equilibrium in this kind of congestion games.

Suggested Citation

  • Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2013. "A formula for Nash equilibria in monotone singleton congestion games," Post-Print halshs-00869876, HAL.
    • Handle: RePEc:hal:journl:halshs-00869876
    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.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Mark Voorneveld & Peter Borm & Freek Van Megen & Stef Tijs & Giovanni Facchini, 1999. "Congestion Games And Potentials Reconsidered," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(03n04), pages 283-299.
    2. repec:fth:tilbur:9998 is not listed on IDEAS
    3. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    4. Thomas Quint & Martin Shubik, 1994. "A Model of Migration," Cowles Foundation Discussion Papers 1088, Cowles Foundation for Research in Economics, Yale University.
    5. Le Breton, M. & Weber, S., 1995. "Strong Equilibrium in a Model with Partial Rivalry," G.R.E.Q.A.M. 95a07, Universite Aix-Marseille III.
    6. Konishi, Hideo & Le Breton, Michel & Weber, Shlomo, 1997. "Equilibria in a Model with Partial Rivalry," Journal of Economic Theory, Elsevier, vol. 72(1), pages 225-237, January.
    7. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Fatima Khanchouche & Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2024. "Nash Equilibria in Two-Resource Congestion Games with Player-Specific Payoff Functions," Games, MDPI, vol. 15(2), pages 1-10, February.
    2. Fatima Khanchouche & Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2024. "Nash Equilibria in Two-Resource Congestion Games with Player-Specific Payoff Functions," Post-Print hal-04506452, HAL.
    3. Fatima Khanchouche & Samir Sbabou & Hatem Smaoui & Ziad Abderrahmane, 2023. "Congestion Games with Player-Specific Payoff Functions: The Case of Two Resources, Computation and Algorithms. First version," Economics Working Paper Archive (University of Rennes & University of Caen) 2023-08, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abderrahmane ZIAD & Samir SBABOU & Hatem SMAOUI, CEMOI, 2011. "Nonsymmetric singleton congestion games: case of two resources," Economics Working Paper Archive (University of Rennes & University of Caen) 201113, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    2. Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2013. "Jeux de congestion finis à choix unique : Théorie, Equilibres, Applications -Calculs et Complexités-," Economics Working Paper Archive (University of Rennes & University of Caen) 201303, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    3. Le Breton, Michel & Shapoval, Alexander & Weber, Shlomo, 2021. "A game-theoretical model of the landscape theory," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 41-46.
    4. Abderrahmane ZIAD & Samir SBABOU & Hatem SMAOUI, 2011. "Nash equilibria in nonsymmetric singleton congestion games with exact partition," Economics Working Paper Archive (University of Rennes & University of Caen) 201115, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    5. Tobias Harks & Max Klimm & Rolf Möhring, 2013. "Strong equilibria in games with the lexicographical improvement property," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 461-482, May.
    6. Nikolai Kukushkin, 2007. "Congestion games revisited," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 57-83, September.
    7. Mark Voorneveld & Peter Borm & Freek Van Megen & Stef Tijs & Giovanni Facchini, 1999. "Congestion Games And Potentials Reconsidered," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(03n04), pages 283-299.
    8. Ryo Kawasaki & Hideo Konishi & Junki Yukawa, 2023. "Equilibria in bottleneck games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 649-685, September.
    9. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    10. Olivier Tercieux & Mark Voorneveld, 2010. "The cutting power of preparation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 85-101, February.
    11. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    12. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    13. Roughgarden, Tim & Tardos, Eva, 2004. "Bounding the inefficiency of equilibria in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 47(2), pages 389-403, May.
    14. Kukushkin, Nikolai S., 2014. "Strong equilibrium in games with common and complementary local utilities," MPRA Paper 55499, University Library of Munich, Germany.
    15. Fatima Khanchouche & Samir Sbabou & Hatem Smaoui & Ziad Abderrahmane, 2023. "Congestion Games with Player-Specific Payoff Functions: The Case of Two Resources, Computation and Algorithms. First version," Economics Working Paper Archive (University of Rennes & University of Caen) 2023-08, Center for Research in Economics and Management (CREM), University of Rennes, University of Caen and CNRS.
    16. Kukushkin, Nikolai S., 2017. "Strong Nash equilibrium in games with common and complementary local utilities," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 1-12.
    17. Nikolai Kukushkin, 2011. "Acyclicity of improvements in finite game forms," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 147-177, February.
    18. Le Breton, Michel & Weber, Shlomo, 2009. "Existence of Pure Strategies Nash Equilibria in Social Interaction Games with Dyadic Externalities," CEPR Discussion Papers 7279, C.E.P.R. Discussion Papers.
    19. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    20. van Megen, F.J.C. & Facchini, G. & Borm, P.E.M. & Tijs, S.H., 1996. "Strong Nash Equilibria and the Potential Maimizer," Discussion Paper 1996-13, Tilburg University, Center for Economic Research.

    More about this item

    Keywords

    Singleton congestion games; Nash equilibria; ordinal preferences;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    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-00869876. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.