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 (US) |
---|---|
Pages (from-to) | 1638-1640 |
Number of pages | 3 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 28 |
Issue number | 3 |
DOIs | |
State | Published - 2014 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Keywords
- Nash equilibrium
- Network design
- Price of anarchy
- Routing