Congestion Games with Malicious Players

被引:0
|
作者
Babaioff, Moshe [1 ]
Kleinberg, Robert [1 ]
Papadimitriou, Christos H. [1 ]
机构
[1] Univ Calif Berkeley, Sch Informat, Berkeley, CA 94720 USA
关键词
Selfish Routing; Malicious Behavior; Equilibrium; Congestion Games;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counterintuitive phenomenon which we demonstrate is the "windfall of malice": paradoxically, when a myopically malicious player gains control of a fraction of the flow, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.
引用
收藏
页码:103 / 112
页数:10
相关论文
共 50 条
  • [1] Congestion games with malicious players
    Babaioff, Moshe
    Kleinberg, Robert
    Papadimitriou, Christos H.
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2009, 67 (01) : 22 - 35
  • [2] Malicious Bayesian Congestion Games
    Gairing, Martin
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 119 - 132
  • [3] Price of Anarchy in Congestion Games with Altruistic/Spiteful Players
    Schroeder, Marc
    [J]. ALGORITHMIC GAME THEORY, SAGT 2020, 2020, 12283 : 146 - 159
  • [4] Stochastic Congestion Games with Risk-Averse Players
    Angelidakis, Haris
    Fotakis, Dimitris
    Lianeas, Thanasis
    [J]. ALGORITHMIC GAME THEORY, SAGT 2013, 2013, 8146 : 86 - 97
  • [5] The sequential price of anarchy for affine congestion games with few players
    de Jong, Jasper
    Uetz, Marc
    [J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (02) : 133 - 139
  • [6] Exact Price of Anarchy for Weighted Congestion Games with Two Players
    van den Bosse, Joran
    Uetz, Marc
    Walter, Matthias
    [J]. COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 159 - 171
  • [7] 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
  • [8] Atomic congestion games with random players: network equilibrium and the price of anarchy
    Chenlan Wang
    Xuan Vinh Doan
    Bo Chen
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 2123 - 2142
  • [9] On satisfiability games and the power of congestion games
    Bilo, Vittorio
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 231 - 240
  • [10] Graphical Congestion Games
    Bilo, Vittorio
    Fanelli, Angelo
    Flammini, Michele
    Moscardelli, Luca
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 70 - +