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

Nash Equilibria in Two-Resource Congestion Games with Player-Specific Payoff Functions

Author

Listed:
  • Fatima Khanchouche

    (UFAS1 - Université Ferhat-Abbas Sétif 1 [Sétif])

  • Samir Sbabou

    (UNICAEN - Université de Caen Normandie - NU - Normandie Université, 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

    (UFAS1 - Université Ferhat-Abbas Sétif 1 [Sétif], 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

In this paper, we examine the class of congestion games with player-specific payoff functions introduced by Milchtaich, I. (1996). Focusing on the special case of two resources, we give a short and simple method for identifying all Nash equilibria in pure strategies. We also provide a computation algorithm based on our theoretical analysis.

Suggested Citation

  • 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.
    • Handle: RePEc:hal:journl:hal-04506452
    DOI: 10.3390/g15020007
    Note: View the original document on HAL open archive server: https://hal.science/hal-04506452
    as

    Download full text from publisher

    File URL: https://hal.science/hal-04506452/document
    Download Restriction: no
    File URL: https://libkey.io/10.3390/g15020007?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
    ---><---

    References listed on IDEAS

    as
    1. Konur, Dinçer & Geunes, Joseph, 2012. "Competitive multi-facility location games with non-identical firms and convex traffic congestion costs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 373-385.
    2. Samir Sbabou & Hatem Smaoui & Abderrahmane Ziad, 2013. "A formula for Nash equilibria in monotone singleton congestion games," Economics Bulletin, AccessEcon, vol. 33(1), pages 334-339.
    3. Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
    4. Xu, Chunhui, 2000. "Computation of noncooperative equilibria in ordinal games," European Journal of Operational Research, Elsevier, vol. 122(1), pages 115-122, April.
    5. Ron Holzman & Dov Monderer, 2015. "Strong equilibrium in network congestion games: increasing versus decreasing costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 647-666, August.
    Full references (including those not matched with items on IDEAS)

    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. 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 & 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.
    3. 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.
    4. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    5. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    6. Xujin Chen & Zhuo Diao & Xiaodong Hu, 2022. "On weak Pareto optimality of nonatomic routing networks," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1705-1723, October.
    7. Milchtaich, Igal, 2009. "Weighted congestion games with separable preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 750-757, November.
    8. Bavly, Gilad & Heller, Yuval & Schreiber, Amnon, 2022. "Social welfare in search games with asymmetric information," Journal of Economic Theory, Elsevier, vol. 202(C).
    9. Darryl Seale & Amnon Rapoport, 2000. "Elicitation of Strategy Profiles in Large Group Coordination Games," Experimental Economics, Springer;Economic Science Association, vol. 3(2), pages 153-179, October.
    10. Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Object-based unawareness: Theory and applications," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
    11. Ouyang, Yanfeng & Wang, Zhaodong & Yang, Hai, 2015. "Facility location design under continuous traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 18-33.
    12. Corine M. Laan & Judith Timmer & Richard J. Boucherie, 2021. "Non-cooperative queueing games on a network of single server queues," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 279-301, April.
    13. Taiyo Maeda & Shigeru Matsumoto & Tadahiko Murata, 2015. "Agent Heterogeneity and Facility Congestion," Computational Economics, Springer;Society for Computational Economics, vol. 46(2), pages 189-203, August.
    14. Jamal Ouenniche & Aristotelis Boukouras & Mohammad Rajabi, 2016. "An Ordinal Game Theory Approach to the Analysis and Selection of Partners in Public–Private Partnership Projects," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 314-343, April.
    15. Juliane Dunkel & Andreas S. Schulz, 2008. "On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 851-868, November.
    16. Penn, Michal & Polukarov, Maria & Tennenholtz, Moshe, 2009. "Congestion games with load-dependent failures: Identical resources," Games and Economic Behavior, Elsevier, vol. 67(1), pages 156-173, September.
    17. Holzman, Ron & Law-Yone, Nissan, 1997. "Strong Equilibrium in Congestion Games," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 85-101, October.
    18. Kukushkin, Nikolai S., 2018. "A universal construction generating potential games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 331-340.
    19. 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.
    20. Blonski, Matthias, 2000. "Characterization of pure strategy equilibria in finite anonymous games," Journal of Mathematical Economics, Elsevier, vol. 34(2), pages 225-233, October.

    More about this item

    Keywords

    game theory; Nash equilibria; congestion games; price of anarchy;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal-04506452. 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.