The price of anarchy in network creation games

Abstract

We study Nash equilibria in the setting of network creation games introduced recently by Fabrikant, Luthra, Maneva, Papadimitriou, and Shenker. In this game we have a set of selfish node players, each creating some incident links, and the goal is to minimize α times the cost of the created links plus sum of the distances to all other players. Fabrikant et al. proved an upper bound O (√α) on the price of anarchy: the relative cost of the lack of coordination. Albers, Eilts, Even-Dar, Mansour, and Roditty show that the price of anarchy is constant for α = O (√ n ) and for α ≥ 12 n ⌈ lg n ⌉, and that the price of anarchy is 15(1+(min{α 2 / n , n 2 /α}) 1/3 ) for any α. The latter bound shows the first sublinear worst-case bound, O ( n 1/3 ), for all α. But no better bound is known for α between ω(√ n ) and o ( n lg n ). Yet α ≈ n is perhaps the most interesting range, for it corresponds to considering the average distance (instead of the sum of distances) to other nodes to be roughly on par with link creation (effectively dividing α by n ). In this article, we prove the first o ( n ε ) upper bound for general α, namely 2 O (√ lg n ) . We also prove a constant upper bound for α = O ( n 1-ε ) for any fixed ε > 0, substantially reducing the range of α for which constant bounds have not been obtained. Along the way, we also improve the constant upper bound by Albers et al. (with the lead constant of 15 ) to 6 for α < ( n /2) 1/2 and to 4 for α < ( n /2) 1/3 . Next we consider the bilateral network variant of Corbo and Parkes, in which links can be created only with the consent of both endpoints and the link price is shared equally by the two. Corbo and Parkes show an upper bound of O (√α) and a lower bound of Ω(lgα) for α ≤ n . In this article, we show that in fact the upper bound O (√α) is tight for α ≤ n , by proving a matching lower bound of Ω(√α). For α > n , we prove that the price of anarchy is Θ( n /√ α). Finally we introduce a variant of both network creation games, in which each player desires to minimize α times the cost of its created links plus the maximum distance (instead of the sum of distances) to the other players. This variant of the problem is naturally motivated by considering the worst case instead of the average case. Interestingly, for the original (unilateral) game, we show that the price of anarchy is at most 2 for α ≥ n , O (min {4 √lg n , ( n /α) 1/3 }) for 2√ lg n ≤ α ≤ n , and O ( n 2/α ) for α < 2√ lg n . For the bilateral game, we prove matching upper and lower bounds of Θ( n /α + 1) for α ≤ n , and an upper bound of 2 for α > n .