Nash equilibria with minimum potential in undirected broadcast games

DOI10.1007/978-3-642-28076-4_22zbMATH Open1351.91009OpenAlexW2276086608MaRDI QIDQ2889916FDOQ2889916

Authors: Yasushi Kawase, Kazuhisa Makino 

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28076-4_22

Recommendations

• Nash equilibria with minimum potential in undirected broadcast games
• The price of stability for undirected broadcast network design with fair cost allocation is constant
• On approximate Nash equilibria in network design
• An \(H _{n/2}\) upper bound on the price of stability of undirected network design games
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games

Mathematics Subject Classification ID

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

Cited In (4)

• Nash equilibria with minimum potential in undirected broadcast games
• The Price of Nash Equilibria in Multicast Transmissions Games
• The price of stability for undirected broadcast network design with fair cost allocation is constant
• Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889916)