The ring design game with fair cost allocation

DOI10.1016/j.tcs.2014.09.035zbMath1303.68026MaRDI QIDQ476847

Gianpiero Monaco, Piotr Sankowski, Dariusz Leniowski, Angelo Fanelli

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.035

zbMATH Keywords

Nash equilibria; network design; price of stability; Shapley cost-sharing

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

91A43: Games involving graphs

91A80: Applications of game theory

Related Items

Improved bounds on equilibria solutions in the network design game, Timing matters: online dynamics in broadcast games, Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions, On the Price of Stability of Undirected Multicast Games, Multicast Network Design Game on a Ring

Cites Work

• Unnamed Item
• Nash equilibria with minimum potential in undirected broadcast games
• Network design with weighted players
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
• Improved lower bounds on the price of stability of undirected network design games
• A class of games possessing pure-strategy Nash equilibria
• The Price of Stability for Network Design with Fair Cost Allocation
• On the Price of Stability for Undirected Network Design
• On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
• On the Value of Coordination in Network Design