The ring design game with fair cost allocation
From MaRDI portal
Publication:476847
DOI10.1016/j.tcs.2014.09.035zbMath1303.68026OpenAlexW2138636172MaRDI 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
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80)
Related Items
Multicast Network Design Game on a Ring, Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions, Timing matters: online dynamics in broadcast games, On the Price of Stability of Undirected Multicast Games, Improved bounds on equilibria solutions in the network design game
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
