Correction: Basic network creation games

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

Research output: Contribution to journalArticle

7 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 languageEnglish (US)
Pages (from-to)1638-1640
Number of pages3
JournalSIAM Journal on Discrete Mathematics
Volume28
Issue number3
DOIs
StatePublished - Jan 1 2014

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Keywords

  • Nash equilibrium
  • Network design
  • Price of anarchy
  • Routing

Fingerprint Dive into the research topics of 'Correction: Basic network creation games'. Together they form a unique fingerprint.

  • Cite this

    Alon, N., Demaine, E. D., Hajiaghayi, M., Kanellopoulos, P., & Leighton, T. (2014). Correction: Basic network creation games. SIAM Journal on Discrete Mathematics, 28(3), 1638-1640. https://doi.org/10.1137/140955343