Basic network creation games
SIAM Journal on Discrete Mathematics(2013)
摘要
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident edge at a time. The central question is what structure the resulting equilibrium graphs have, in particular, how well they globally minimize diameter. For the local-average-distance version, we prove an upper bound of 2O(√ lg n), a lower bound of 3, a tight bound of exactly 2 for trees, and give evidence of a general polylogarithmic upper bound. For the local-diameter version, we prove a lower bound of Ω(√ n), and a tight upper bound of 3 for trees. All of our upper bounds apply equally well to previously extensively studied network creation games, both in terms of the diameter metric described above and the previously studied price of anarchy (which are related by constant factors). In surprising contrast, our model has no parameter α for the link creation cost, so our results automatically apply for all values of alpha without additional effort; furthermore, equilibrium can be checked in polynomial time in our model, unlike previous models. Our perspective enables simpler and more general proofs that get at the heart of network creation games.
更多查看译文
关键词
diameter metric,nash equilibrium,price of anarchy,network creation game,local-diameter version,local average distance,routing,network design,natural network creation game,upper bound,local diameter,link creation cost,basic network creation game,general proof,local-average-distance version,lower bound,polynomial time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络