Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
From MaRDI portal
Publication:3162510
DOI10.1007/978-3-642-16170-4_9zbMath1310.91036OpenAlexW3136837020MaRDI QIDQ3162510
Angelo Fanelli, Ioannis Caragiannis, Gianpiero Monaco, Vittorio Bilò
Publication date: 19 October 2010
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_9
Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (3)
Social context congestion games ⋮ Nash equilibria with minimum potential in undirected broadcast games ⋮ Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- 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
- Tight Bounds for Selfish and Greedy Load Balancing
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Algorithms, games, and the internet
- Algorithms – ESA 2005
This page was built for publication: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games