On the Price of Stability of Undirected Multicast Games
From MaRDI portal
Publication:2959842
DOI10.1007/978-3-662-54110-4_25zbMath1404.91052arXiv1610.06515OpenAlexW2538740300MaRDI QIDQ2959842
Debmalya Panigrahi, Samuel Haney, Rupert Freeman
Publication date: 10 February 2017
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06515
Games involving graphs (91A43) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (2)
Timing matters: online dynamics in broadcast games ⋮ A unifying approximate potential for weighted congestion games
Cites Work
- Unnamed Item
- Nash equilibria with minimum potential in undirected broadcast games
- The ring design game with fair cost allocation
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- 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
- Tighter Bounds for Graph Steiner Tree Approximation
- Steiner Tree Approximation via Iterative Randomized Rounding
This page was built for publication: On the Price of Stability of Undirected Multicast Games
