{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:48:20Z","timestamp":1760143700236,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Games"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/g15020007","type":"journal-article","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T10:40:17Z","timestamp":1708944017000},"page":"7","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nash Equilibria in Two-Resource Congestion Games with Player-Specific Payoff Functions"],"prefix":"10.3390","volume":"15","author":[{"given":"Fatima","family":"Khanchouche","sequence":"first","affiliation":[{"name":"Fundamental and Numerical Mathematics Laboratory, Department of Mathematics, Faculty of Sciences, Ferhat Abbas University of Setif 1, Setif 19137, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Sbabou","sequence":"additional","affiliation":[{"name":"Center of Research in Economics and Management, University of Caen, Esplanade de la Paix, 14000 Caen, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5458-3948","authenticated-orcid":false,"given":"Hatem","family":"Smaoui","sequence":"additional","affiliation":[{"name":"Center of Economics and Management of the Indian Ocean, University of R\u00e9union, 15 Avenue Ren\u00e9 Cassin, BP 7115, 97715 Saint Denis, Cedex 9, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderrahmane","family":"Ziad","sequence":"additional","affiliation":[{"name":"CREM\u2014Centre de Recherche en \u00c9conomie et Management, UNICAEN\u2014Universit\u00e9 de Caen Normandie, NU\u2014Normandie Universit\u00e9, 14000 Caen, France"},{"name":"Laboratoire de Math\u00e9matiques Appliqu\u00e9es (LaMA), Ferhat Abbas University of Setif 1, Setif 19137, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","article-title":"A class of games possessing pure-strategy Nash equilibrium","volume":"2","author":"Rosenthal","year":"1973","journal-title":"Int. J. Game Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Roughgarden, T. (2005). Selfish Routing and the Price of Anarchy, MIT Press.","DOI":"10.21236\/ADA637949"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.tre.2011.06.005","article-title":"Competitive multi-facility location games with non-identical firms and convex traffic congestion costs","volume":"48","author":"Konur","year":"2012","journal-title":"Transp. Part Logist. Transp. Rev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","article-title":"Selfish Load Balancing and Atomic Congestion Games","volume":"47","author":"Suri","year":"2007","journal-title":"Algorithmica"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","article-title":"Potential games","volume":"14","author":"Monderer","year":"1996","journal-title":"Games Econ. Behav."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., and Talwar, K. (2004, January 13\u201315). The complexity of pure Nash equilibria. Proceedings of the 36th ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/1007352.1007445"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","article-title":"Selfish unsplittable flows","volume":"348","author":"Fotakis","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","article-title":"The structure and complexity of Nash equilibria for a selfish routing game","volume":"410","author":"Fotakis","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/s00182-014-0448-4","article-title":"Strong equilibrium in network congestion games: Increasing versus decreasing costs","volume":"44","author":"Holzman","year":"2015","journal-title":"Int. J. Game Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1187436.1216584","article-title":"Algorithms for pure Nash equilibria in weighted congestion games","volume":"11","author":"Panagopoulou","year":"2007","journal-title":"ACM J. Exp. Algorithmics"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, L., and Ku\u010dera, A. (2007). Mathematical Foundations of Computer Science 2007, MFCS 2007, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-540-74456-6"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","article-title":"Pure Nash equilibria in player-specific and weighted congestion games","volume":"410","author":"Ackermann","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jeth.1996.2203","article-title":"Equilibrium in a model with partial rivalry","volume":"72","author":"Konishi","year":"1997","journal-title":"J. Econ. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","article-title":"Congestion games with player-specific payoff functions","volume":"13","author":"Milchtaich","year":"1996","journal-title":"Games Econ. Behav."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Khanchouche, F., Sbabou, S., Smaoui, H., and Ziad, A. (2024, February 17). Congestion Games with Player-Specific Payoff Functions: The Case of Two Resources, Computation and Algorithms. First Version. Available online: https:\/\/ideas.repec.org\/p\/tut\/cremwp\/2023-08.html.","DOI":"10.3390\/g15020007"},{"key":"ref_16","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., and Sun, O. (2005, January 9\u201313). Fast and compact: A simple class of congestion games. Proceedings of the 20th National Conference on Artificial Intelligence, Pittsburgh, PA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1455248.1455249","article-title":"On the impact of combinatorial structure on congestion games","volume":"55","author":"Ackermann","year":"2008","journal-title":"J. ACM"},{"key":"ref_18","first-page":"334","article-title":"A formula for Nash equilibria in monotone singleton congestion games","volume":"33","author":"Sbabou","year":"2013","journal-title":"Econ. Bull. AccessEcon"},{"key":"ref_19","unstructured":"Koutsoupias, E., and Papadimitriou, C.H. (1999, January 4\u20136). Worst-case equilibria. Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1026476425031","article-title":"Ordinal Games and Generalized Nash and Stackelberg Solutions","volume":"107","author":"Cruz","year":"2000","journal-title":"J. Optim. Theory Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(99)00059-4","article-title":"Computation of noncooperative equilibria in ordinal games","volume":"122","author":"Xu","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1142\/S0219198908001868","article-title":"Ordinal Games","volume":"10","author":"Durieu","year":"2008","journal-title":"Int. Game Theory Rev."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/s10957-015-0844-3","article-title":"An Ordinal Game Theory Approach to the Analysis and Selection of Partners in Public\u2013Private Partnership Projects","volume":"169","author":"Ouenniche","year":"2016","journal-title":"J. Optim. Theory Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","article-title":"The price of stability for network design with fair cost allocation","volume":"38","author":"Anshellevich","year":"2008","journal-title":"SIAM J. Comput."}],"container-title":["Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-4336\/15\/2\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:05:06Z","timestamp":1760105106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-4336\/15\/2\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,26]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["g15020007"],"URL":"https:\/\/doi.org\/10.3390\/g15020007","relation":{},"ISSN":["2073-4336"],"issn-type":[{"type":"electronic","value":"2073-4336"}],"subject":[],"published":{"date-parts":[[2024,2,26]]}}}