2012/11/09 by Yann Disser, Disser, Yann, Andreas Emil Feldmann +5
Computer Science · #91A10 #91A43 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #cs.GT #msc:91A10 #msc:91A43
paper · pdf · doi:10.48550/arxiv.1211.2090
14 pages
arxiv created 2013/03/22 · arxiv updated 2013/03/25
In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k3(k+1)/2-k2) / (1+k3(k+1)/2-k2) Hk = (1 - Θ(1/k4)) Hk, where Hk denotes the k-th harmonic number. This improves on the known upper bound of Hk, which is also valid for directed graphs but for these, in contrast, is tight. Hence, we give the first non-trivial upper bound on the price of stability for undirected Shapley network design games that is valid for an arbitrary number of players. Our bound is proved by analyzing the price of stability restricted to Nash equilibria that minimize the potential function of the game. We also present a game with k=3 players in which such a restricted price of stability is 1.634. This shows that the analysis of Bilò and Bove (Journal of Interconnection Networks, Volume 12, 2011) is tight. In addition, we give an example for three players that improves the lower bound on the (unrestricted) price of stability to 1.571.