IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v15y2024i2p7-d1346235.html
   My bibliography  Save this article

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

Author

Listed:
  • Fatima Khanchouche

    (Fundamental and Numerical Mathematics Laboratory, Department of Mathematics, Faculty of Sciences, Ferhat Abbas University of Setif 1, Setif 19137, Algeria
    These authors contributed equally to this work.)

  • Samir Sbabou

    (Center of Research in Economics and Management, University of Caen, Esplanade de la Paix, 14000 Caen, France
    These authors contributed equally to this work.)

  • Hatem Smaoui

    (Center of Economics and Management of the Indian Ocean, University of Réunion, 15 Avenue René Cassin, BP 7115, 97715 Saint Denis, Cedex 9, France
    These authors contributed equally to this work.)

  • Abderrahmane Ziad

    (CREM—Centre de Recherche en Économie et Management, UNICAEN—Université de Caen Normandie, NU—Normandie Université, 14000 Caen, France
    Laboratoire de Mathématiques Appliquées (LaMA), Ferhat Abbas University of Setif 1, Setif 19137, Algeria
    These authors contributed equally to this work.)

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," Games, MDPI, vol. 15(2), pages 1-10, February.
    • Handle: RePEc:gam:jgames:v:15:y:2024:i:2:p:7-:d:1346235
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/15/2/7/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2073-4336/15/2/7/
    Download Restriction: no
    ---><---

    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," Post-Print hal-04506452, HAL.
    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. Christian Ewerhart, 2020. "Ordinal potentials in smooth games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(4), pages 1069-1100, November.
    5. Tami Tamir, 2023. "Cost-sharing games in real-time scheduling systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 273-301, March.
    6. Dominique Barth & Benjamin Cohen-Boulakia & Wilfried Ehounou, 2022. "Distributed Reinforcement Learning for the Management of a Smart Grid Interconnecting Independent Prosumers," Energies, MDPI, vol. 15(4), pages 1-19, February.
    7. 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.
    8. Arnold, Tone & Wooders, Myrna, 2002. "Dynamic Club Formation with Coordination," Economic Research Papers 269414, University of Warwick - Department of Economics.
    9. 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.
    10. Hideo Konishi, 2004. "Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters," Transportation Science, INFORMS, vol. 38(3), pages 315-330, August.
    11. 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.
    12. Igal Milchtaich, 2000. "Generic Uniqueness of Equilibrium in Large Crowding Games," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 349-364, August.
    13. Naouel Yousfi-Halimi & Mohammed Said Radjef & Hachem Slimani, 2018. "Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations," Annals of Operations Research, Springer, vol. 267(1), pages 607-628, August.
    14. Milchtaich, Igal, 2009. "Weighted congestion games with separable preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 750-757, November.
    15. Aner Sela & Ishay Rabi & Chen Cohen, 2023. "An Algorithmic Analysis of Parallel Contests," Working Papers 2317, Ben-Gurion University of the Negev, Department of Economics.
    16. 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.
    17. 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.
    18. Bavly, Gilad & Heller, Yuval & Schreiber, Amnon, 2022. "Social welfare in search games with asymmetric information," Journal of Economic Theory, Elsevier, vol. 202(C).
    19. Kukushkin, Nikolai S., 2015. "Cournot tatonnement and potentials," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 117-127.
    20. 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.

    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:gam:jgames:v:15:y:2024:i:2:p:7-:d:1346235. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.