{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:37Z","timestamp":1778087677655,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,24]],"date-time":"2020-05-24T00:00:00Z","timestamp":1590278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,5,24]],"date-time":"2020-05-24T00:00:00Z","timestamp":1590278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71601008"],"award-info":[{"award-number":["71601008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present a new model of congestion games with finite and random number of players, and an analytical method to compute the random path and link flows.  We study the equilibrium condition,  reformulate it as an equivalent variational inequality problem, and establish the existence and non-uniqueness of the equilibria. We also upper bound the price of anarchy with affine cost functions to characterize the quality of the equilibria. The upper bound is tight in some special cases, including the case of deterministic players. Finally a general lower bound is also provided.<\/jats:p>","DOI":"10.1007\/s10878-020-00583-3","type":"journal-article","created":{"date-parts":[[2020,5,24]],"date-time":"2020-05-24T04:04:00Z","timestamp":1590293040000},"page":"2123-2142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Atomic congestion games with random players: network equilibrium and the price of anarchy"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1121-498X","authenticated-orcid":false,"given":"Chenlan","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8572-5208","authenticated-orcid":false,"given":"Xuan Vinh","family":"Doan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7605-9453","authenticated-orcid":false,"given":"Bo","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,24]]},"reference":[{"issue":"5","key":"583_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland S, Dumrauf D, Gairing M, Monien B, Schoppmann F (2011) Exact price of anarchy for polynomial congestion games. SIAM J Comput 40(5):1211\u20131233","journal-title":"SIAM J Comput"},{"key":"583_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi I, Monderer D, Tennenholtz M (2006) Resource Selection Games with Unknown Number of Players. In: AAMAS \u201906 Proceedings of the fifth international joint conference on autonomous agents and multiagent systems, pp 819\u2013825","DOI":"10.1145\/1160633.1160782"},{"key":"583_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Epstein A (2005) The price of routing unsplittable flow. In: Proceedings of the thirty-seventh annual ACM symposium on theory of computing, STOC \u201905, pp 57\u201366","DOI":"10.1145\/1060590.1060599"},{"issue":"1","key":"583_CR4","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/070702370","volume":"42","author":"B Awerbuch","year":"2013","unstructured":"Awerbuch B, Azar Y, Epstein A (2013) The price of routing unsplittable flow. SIAM J Comput 42(1):160\u2013177","journal-title":"SIAM J Comput"},{"key":"583_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Koutsoupias E (2005) The price of anarchy of finite congestion games. In: Proceedings of the thirty-seventh annual ACM symposium on theory of computing, STOC \u201905, pp 67\u201373","DOI":"10.1145\/1060590.1060600"},{"key":"583_CR6","doi-asserted-by":"crossref","unstructured":"Cominetti R, Scarsini M, Schr\u00f6der M, Stier-Moses NE (2019) Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs arXiV:1903.03309","DOI":"10.1145\/3328526.3329579"},{"key":"583_CR7","unstructured":"Cominetti R, Scarsini M, Schr\u00f6der M, Stier-Moses NE (2020) Convergence of Large Atomic Congestion Games arXiV:2001.02797"},{"key":"583_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.trb.2018.11.010","volume":"119","author":"J Correa","year":"2019","unstructured":"Correa J, Hoeksma R, Schr\u00f6der M (2019) Network congestion games are robust to variable demand. Transp Res Part B Methodol 119:69\u201378","journal-title":"Transp Res Part B Methodol"},{"issue":"4","key":"583_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa JR, Schulz AS, Stier-Moses NE (2004) Selfish routing in capacitated networks. Math Oper Res 29(4):961\u2013976","journal-title":"Math Oper Res"},{"issue":"2","key":"583_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.geb.2008.01.001","volume":"64","author":"JR Correa","year":"2008","unstructured":"Correa JR, Schulz AS, Stier-Moses NE (2008) A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ Behav 64(2):457\u2013469","journal-title":"Games Econ Behav"},{"key":"583_CR11","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Proceedings of the 16th annual symposium on theoretical aspects of computer science, pp 404\u2013413","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"3","key":"583_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s001820050079","volume":"27","author":"RB Myerson","year":"1998","unstructured":"Myerson RB (1998) Population uncertainty and Poisson games. Int J Game Theory 27(3):375\u2013392","journal-title":"Int J Game Theory"},{"issue":"3","key":"583_CR13","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/moor.1070.0258","volume":"32","author":"G Perakis","year":"2007","unstructured":"Perakis G (2007) The \u201cprice of anarchy\u201d under nonlinear and asymmetric costs. Math Oper Res 32(3):614\u2013628","journal-title":"Math Oper Res"},{"issue":"1","key":"583_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2(1):65\u201367","journal-title":"Int J Game Theory"},{"key":"583_CR15","volume-title":"A first course in probability","author":"SM Ross","year":"2002","unstructured":"Ross SM (2002) A first course in probability, 6th edn. Prentice Hall, Englewood Cliffs","edition":"6"},{"issue":"2","key":"583_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259","journal-title":"J ACM"},{"issue":"2","key":"583_CR17","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden T, Tardos \u00c9 (2004) Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econ Behav 47(2):389\u2013403","journal-title":"Games Econ Behav"},{"key":"583_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.trb.2014.08.009","volume":"70","author":"C Wang","year":"2014","unstructured":"Wang C, Doan XV, Chen B (2014) Price of anarchy for non-atomic congestion games with stochastic demands. Transp Res Part B Methodol 70:90\u2013111","journal-title":"Transp Res Part B Methodol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00583-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00583-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00583-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:48:41Z","timestamp":1664354921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00583-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00583-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,24]]},"assertion":[{"value":"24 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}