Nash equilibria with minimum potential in undirected broadcast games

DOI10.1016/j.tcs.2013.02.031zbMath1291.91038OpenAlexW2161428096MaRDI QIDQ390911

Kazuhisa Makino, Yasushi Kawase

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.031

zbMATH Keywords

price of anarchypotential gameprice of stabilitynetwork design game

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

The price of anarchy and stability in general noisy best-response dynamics ⋮ Multicast Network Design Game on a Ring ⋮ Timing matters: online dynamics in broadcast games ⋮ On the Price of Stability of Undirected Multicast Games ⋮ The ring design game with fair cost allocation ⋮ Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games ⋮ Improved bounds on equilibria solutions in the network design game ⋮ Surrogate optimization for \(p\)-norms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
• The statistical mechanics of strategic interaction
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• Nash Equilibria with Minimum Potential in Undirected Broadcast Games
• Designing Network Protocols for Good Equilibria
• Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
• On the Value of Coordination in Network Design
• Robust Equilibria of Potential Games

This page was built for publication: Nash equilibria with minimum potential in undirected broadcast games