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