Network congestion games are robust to variable demand

被引：7

作者：

Correa, Jose ^{[1
]}

Hoeksma, Ruben ^{[2
]}

Schroeder, Marc ^{[3
]}

机构：

[1] Univ Chile, Santiago, Chile

[2] Univ Bremen, Bremen, Germany

[3] Rhein Westfal TH Aachen, Aachen, Germany

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 2019年 / 119卷

关键词：

ANARCHY; PRICE; MODEL;

D O I：

10.1016/j.trb.2018.11.010

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

We consider a non-atomic network congestion game with incomplete information in which nature decides which commodities travel. The users of a commodity do not know which other commodities travel and only have distributional information about their presence. Our main result is that the price of anarchy bounds known for the deterministic demand game also apply to the Bayesian game with random demand, even if the travel probabilities of different commodities are arbitrarily correlated. Moreover, the extension result of price of anarchy bounds for complete information games to incomplete information games in which the set of players is randomly determined can be generalized to the class of smooth games. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：69 / 78

页数：10

共 50 条

[41] Dynamics in Congestion Games
Shah, Devavrat
Shin, Jinwoo
[J]. SIGMETRICS 2010: PROCEEDINGS OF THE 2010 ACM SIGMETRICS INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SYSTEMS, 2010, 38 (01): : 107 - 118
[42] Graphical Congestion Games
Bilo, Vittorio
Fanelli, Angelo
Flammini, Michele
Moscardelli, Luca
[J]. ALGORITHMICA, 2011, 61 (02) : 274 - 297
[43] Congestion games revisited
Nikolai S. Kukushkin
[J]. International Journal of Game Theory, 2007, 36 : 57 - 83
[44] Atomic congestion games with random players: network equilibrium and the price of anarchy
Wang, Chenlan
Xuan Vinh Doan
Chen, Bo
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 2123 - 2142
[45] The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
Julian Nickerl
[J]. Theory of Computing Systems, 2021, 65 : 1094 - 1109
[46] Strong equilibrium in network congestion games: increasing versus decreasing costs
Ron Holzman
Dov Monderer
[J]. International Journal of Game Theory, 2015, 44 : 647 - 666
[47] Self-Fulfilling Signal of an Endogenous State in Network Congestion Games
Tatsuya Iwase
Yukihiro Tadokoro
Daisuke Fukuda
[J]. Networks and Spatial Economics, 2017, 17 : 889 - 909
[48] Chaotic congestion games
Naimzada, Ahmad Kabir
Raimondo, Roberto
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2018, 321 : 333 - 348
[49] How hard is it to find extreme Nash equilibria in network congestion games?
Gassner, Elisabeth
Hatzl, Johannes
Krumke, Sven O.
Sperber, Heike
Woeginger, Gerhard J.
[J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 4989 - 4999
[50] The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
Nickerl, Julian
[J]. THEORY OF COMPUTING SYSTEMS, 2021, 65 (07) : 1094 - 1109

← 1 2 3 4 5 →