On the Price of Anarchy of Highly Congested Nonatomic Network Games

被引：7
|
作者：
Colini-Baldeschi, Riccardo [1 ]
Cominetti, Roberto [2 ]
Scarsini, Marco [1 ]
机构：
[1] LUISS, Dipartimento Econ & Finanza, Viale Romania 32, I-00197 Rome, Italy
[2] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile
来源：
ALGORITHMIC GAME THEORY, SAGT 2016 | 2016年 / 9928卷
关键词：
SENSITIVITY-ANALYSIS; EQUILIBRIA;
D O I：
10.1007/978-3-662-53354-3_10
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we show that, under suitable conditions, the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case. The counterexamples occur in simple parallel graphs.
引用
收藏
页码：117 / 128
页数：12
相关论文
共 50 条
  • [1] Price of Anarchy for Highly Congested Routing Games in Parallel Networks
    Riccardo Colini-Baldeschi
    Roberto Cominetti
    Marco Scarsini
    Theory of Computing Systems, 2019, 63 : 90 - 113
  • [2] Price of Anarchy for Highly Congested Routing Games in Parallel Networks
    Colini-Baldeschi, Riccardo
    Cominetti, Roberto
    Scarsini, Marco
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (01) : 90 - 113
  • [3] A geometric approach to the price of anarchy in nonatomic congestion games
    Correa, Jose R.
    Schulz, Andreas S.
    Stier-Moses, Nicolas E.
    GAMES AND ECONOMIC BEHAVIOR, 2008, 64 (02) : 457 - 469
  • [4] A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games
    Wu, Zijun
    Moehring, Rolf H.
    MATHEMATICS OF OPERATIONS RESEARCH, 2023, 48 (03) : 1364 - 1392
  • [5] The price of anarchy in nonatomic consumption-relevance congestion games
    Kliemann, Lasse
    NETWORKS, 2013, 62 (02) : 83 - 94
  • [6] The Price of Anarchy in Network Creation Games
    Demaine, Erik D.
    Hajiaghayi, Mohammadtaghi
    Mahini, Hamid
    Zadimoghaddam, Morteza
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (02)
  • [7] The Price of Anarchy in Network Creation Games
    Demaine, Erik D.
    Hajiaghayi, MohammadTaghi
    Mahini, Hamid
    Zadimoghaddam, Morteza
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 292 - 298
  • [8] The Price of Anarchy in Cooperative Network Creation Games
    Demaine, Erik D.
    Hajiaghayi, Mohammadtaghi
    Mahini, Hamid
    Zadimoghaddam, Morteza
    ACM SIGECOM EXCHANGES, 2009, 8 (02)
  • [9] The Price of Anarchy in Network Creation Games Is (Mostly) Constant
    Mihalak, Matus
    Schlegel, Jan Christoph
    THEORY OF COMPUTING SYSTEMS, 2013, 53 (01) : 53 - 72
  • [10] The Price of Anarchy in Network Creation Games Is (Mostly) Constant
    Mihalak, Matus
    Schlegel, Jan Christoph
    ALGORITHMIC GAME THEORY, 2010, 6386 : 276 - 287
12345