The ring design game with fair cost allocation
From MaRDI portal
(Redirected from Publication:476847)
Recommendations
Cites work
- A class of games possessing pure-strategy Nash equilibria
- 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
- Nash equilibria with minimum potential in undirected broadcast games
- Network design with weighted players
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the price of stability for undirected network design
- On the value of coordination in network design
- The Price of Stability for Network Design with Fair Cost Allocation
- Worst-case equilibria
Cited in
(7)- 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
- 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
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)