Correction: Basic network creation games

被引：0
作者：
Alon, Noga [1 ,2 ]
Demaine, Erik D. [3 ]
Hajiaghayi, Mohammadtaghi [4 ]
Kanellopoulos, Panagiotis [5 ]
Leighton, Tom [6 ,7 ]
机构：
[1] Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv
[2] IAS, Princeton University, Princeton, 08540, NJ
[3] MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, 02139, MA
[4] Computer Science Department, University of Maryland, College Park, 20742, MD
[5] Computer Engineering and Informatics Department, University of Patras, Rio
[6] Department of Mathematics, Massachusetts Institute of Technology, Cambridge, 02139, MA
[7] Akamai Technologies, Cambridge, 02142, MA
来源：
SIAM Journal on Discrete Mathematics | 2014年 / 28卷 / 03期
基金：
美国国家科学基金会;
关键词：
Nash equilibrium; Network design; Price of anarchy; Routing;
D O I：
10.1137/140955343
中图分类号：
学科分类号：
摘要：
We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge {v, w} of the graph with {v, w′}, for any vertex w′, does not decrease the total sum of distances from v to all other nodes (a property called sum equilibrium). © 2014 Society for Industrial and Applied Mathematics.
引用
收藏
页码：1638 / 1640
页数：2
相关论文
共 50 条
  • [21] A Bounded Budget Network Creation Game
    Ehsani, Shayan
    Fadaee, Saber Shokat
    Fazli, Mohammadamin
    Mehrabian, Abbas
    Sadeghabad, Sina Sadeghian
    Safari, Mohammadali
    Saghafian, Morteza
    ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (04)
  • [22] On a Bounded Budget Network Creation Game
    Ehsan, Shayan
    Fazli, MohammadAmin
    Sadeghabad, Sina Sadeghian
    Safari, MohammadAli
    Saghafian, Morteza
    ShokatFadaei, Saber
    Mehrabian, Abbas
    SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 207 - 214
  • [23] Socially-Aware Network Design Games
    Elias, Jocelyne
    Martignon, Fabio
    Avrachenkov, Konstantin
    Neglia, Giovanni
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [24] Timed network games
    Avni, Guy
    Guha, Shibashis
    Kupferman, Orna
    INFORMATION AND COMPUTATION, 2023, 290
  • [25] Social network games
    Simon, Sunil
    Apt, Krzysztof R.
    JOURNAL OF LOGIC AND COMPUTATION, 2015, 25 (01) : 207 - 242
  • [26] Financial Network Games
    Kanellopoulos, Panagiotis
    Kyropoulou, Maria
    Zhou, Hao
    ICAIF 2021: THE SECOND ACM INTERNATIONAL CONFERENCE ON AI IN FINANCE, 2021,
  • [27] Network Movement Games
    Flammini, M.
    Gallotti, V.
    Melideo, G.
    Monaco, G.
    Moscardelli, L.
    THEORETICAL COMPUTER SCIENCE, 2017, 667 : 101 - 118
  • [28] Stackelberg thresholds in network routing games or the value of altruism
    Sharma, Yogeshwer
    Williamson, David P.
    GAMES AND ECONOMIC BEHAVIOR, 2009, 67 (01) : 174 - 190
  • [29] Stackelberg Thresholds in Network Routing Games or The Value of Altruism
    Sharma, Yogeshwer
    Williamson, David R.
    EC'07: PROCEEDINGS OF THE EIGHTH ANNUAL CONFERENCE ON ELECTRONIC COMMERCE, 2007, : 93 - 102
  • [30] Graphon Games: A Statistical Framework for Network Games and Interventions
    Parise, Francesca
    Ozdaglar, Asuman
    ECONOMETRICA, 2023, 91 (01) : 191 - 225
12345