The price of stability for undirected broadcast network design with fair cost allocation is constant
From MaRDI portal
Publication:2206821
DOI10.1016/j.geb.2014.09.010zbMath1452.91051MaRDI QIDQ2206821
Luca Moscardelli, Vittorio Bilò, Michele Flammini
Publication date: 26 October 2020
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2014.09.010
91A43: Games involving graphs
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Designing Networks with Good Equilibria under Uncertainty, A Characterization of Undirected Graphs Admitting Optimal Cost Shares, The Price of Stability of Weighted Congestion Games, Cost-sharing games in real-time scheduling systems, Designing cost-sharing methods for Bayesian games, Improved bounds on equilibria solutions in the network design game, A unifying approximate potential for weighted congestion games, On the sequential price of anarchy of isolation games
Cites Work
- Unnamed Item
- Unnamed Item
- On the performance of approximate equilibria in congestion games
- Tight bounds for selfish and greedy load balancing
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- Sharing the cost of multicast transmissions in wireless networks
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Improved lower bounds on the price of stability of undirected network design games
- A class of games possessing pure-strategy Nash equilibria
- Nash Equilibria with Minimum Potential in Undirected Broadcast Games
- On a network creation game
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Price of Stability for Undirected Network Design
- Network games
- The price of anarchy of finite congestion games
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the Value of Coordination in Network Design
- Capacitated Network Design Games
- Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
- Algorithms – ESA 2005
- Equilibrium points in n -person games
