The ring design game with fair cost allocation
From MaRDI portal
Publication:476847
DOI10.1016/J.TCS.2014.09.035zbMATH Open1303.68026OpenAlexW2138636172MaRDI QIDQ476847FDOQ476847
Authors: Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski 
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
Recommendations
Applications of game theory (91A80) Games involving graphs (91A43) Network design and communication in computer systems (68M10)
Cites Work
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- On the value of coordination in network design
- Network design with weighted players
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- On the price of stability for undirected network design
- Nash equilibria with minimum potential in undirected broadcast games
- Improved lower bounds on the price of stability of undirected network design games
Cited In (7)
- On the price of stability of undirected multicast games
- Multicast network design game on a ring
- Improved bounds on equilibria solutions in the network design game
- Timing matters: online dynamics in broadcast games
- On equilibria for ADM minimization games
- On equilibria for ADM minimization games
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
This page was built for publication: The ring design game with fair cost allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476847)
