Multicast Network Design Game on a Ring

DOI10.1007/978-3-319-26626-8_32zbMath1474.91024arXiv1507.04222OpenAlexW2219066727MaRDI QIDQ3467862

Matúš Mihalák, Akaki Mamageishvili

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04222

zbMATH Keywords

Nash equilibriumring topologynetwork design gamepotential-optimum price of stability/anarchymyopic sequential price of stability/anarchyprice of stability/anarchy

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (1)

The price of anarchy and stability in general noisy best-response dynamics

Uses Software

• CGAL

Cites Work

• Nash equilibria with minimum potential in undirected broadcast games
• The ring design game with fair cost allocation
• When ignorance helps: graphical multicast cost sharing games
• Call control in rings
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
• On the sequential price of anarchy of isolation games
• Improved lower bounds on the price of stability of undirected network design games
• The curse of simultaneity
• An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games
• The Price of Stability for Network Design with Fair Cost Allocation
• On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
• Computing on an anonymous ring
• Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games

This page was built for publication: Multicast Network Design Game on a Ring