Correction: Basic network creation games

Noga Alon; Erik D. Demaine; Mohammadtaghi Hajiaghayi; Panagiotis Kanellopoulos; Tom Leighton

doi:10.1137/140955343

Correction: Basic network creation games

Noga Alon^*, Erik D. Demaine, Mohammadtaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

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).

Original language	English
Pages (from-to)	1638-1640
Number of pages	3
Journal	SIAM Journal on Discrete Mathematics
Volume	28
Issue number	3
DOIs	https://doi.org/10.1137/140955343
State	Published - 2014

Funding

Funders	Funder number
National Science Foundation	CCF-1161626, 1053605

Keywords

Nash equilibrium
Network design
Price of anarchy
Routing

Access to Document

10.1137/140955343

Cite this

@article{bbe774562d2e48a5917b4b4d72b6a289,

title = "Correction: Basic network creation games",

abstract = "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).",

keywords = "Nash equilibrium, Network design, Price of anarchy, Routing",

author = "Noga Alon and Demaine, {Erik D.} and Mohammadtaghi Hajiaghayi and Panagiotis Kanellopoulos and Tom Leighton",

note = "Publisher Copyright: {\textcopyright} 2014 Society for Industrial and Applied Mathematics.",

year = "2014",

doi = "10.1137/140955343",

language = "אנגלית",

volume = "28",

pages = "1638--1640",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "3",

}

TY - JOUR

T1 - Correction

T2 - Basic network creation games

AU - Alon, Noga

AU - Demaine, Erik D.

AU - Hajiaghayi, Mohammadtaghi

AU - Kanellopoulos, Panagiotis

AU - Leighton, Tom

PY - 2014

Y1 - 2014

N2 - 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).

AB - 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).

KW - Nash equilibrium

KW - Network design

KW - Price of anarchy

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=84907983755&partnerID=8YFLogxK

U2 - 10.1137/140955343

DO - 10.1137/140955343

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84907983755

SN - 0895-4801

VL - 28

SP - 1638

EP - 1640

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -

Correction: Basic network creation games

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this