Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An O( lognloglogn) upper bound on the price of stability for undirected Shapley network design games
Information Processing Letters
Network Design with Weighted Players
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Social context congestion games
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Nash equilibria with minimum potential in undirected broadcast games
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Enforcing efficient equilibria in network design games via subsidies
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
Price of stability in polynomial congestion games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Social context congestion games
Theoretical Computer Science
| Hi-index | 0.01 |
Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda. Even though the generalization of such games in directed networks is well understood in terms of the price of stability (it is exactly Hn, the n-th harmonic number, for games with n players), far less is known for network design games in undirected networks. The upper bound carries over to this case as well while the best known lower bound is 42/23 ≅ 1.826. For more restricted but interesting variants of such games such as broadcast and multicast games, sublogarithmic upper bounds are known while the best known lower bound is 12/7 ≅ 1.714. In the current paper, we improve the lower bounds as follows. We break the psychological barrier of 2 by showing that the price of stability of undirected network design games is at least 348/155 ≅ 2.245. Our proof uses a recursive construction of a network design game with a simple gadget as the main building block. For broadcast and multicast games, we present new lower bounds of 20/11 ≅ 1.818 and 1.862, respectively.