The Price of Nash Equilibria in Multicast Transmissions Games

DOI10.1007/978-3-540-77120-3_35MaRDI QIDQ5387773zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò

Publication date 27 May 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_35

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Noncooperative games (91A10)

Recommendations

• On the price of stability of undirected multicast games
• Algorithms and Computation
• Congestion Pricing and Noncooperative Games in Communication Networks
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Nash equilibria with minimum potential in undirected broadcast games
• Nash equilibria with minimum potential in undirected broadcast games
• Nash equilibria in concurrent priced games
• Optimal Nash equilibria for bandwidth allocation
• scientific article; zbMATH DE number 1981033

Cites work

• A course in game theory.
• Algorithms and Computation
• Applications of approximation algorithms to cooperative games
• Approximation and collusion in multicast cost sharing
• Approximation and Online Algorithms
• Equilibrium points in n -person games
• Hardness results for multicast cost sharing.
• Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
• Near-optimal network design with selfish agents
• Non-cooperative games
• Sharing the cost of muliticast transmissions (preliminary version)
• Sharing the cost of multicast transmissions in wireless networks
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• Structural Information and Communication Complexity
• Worst-case equilibria

Cited in

(13)

• Designing fast converging cost sharing methods for multicast transmissions
• On the convergence of multicast games in directed networks
• On the price of stability of undirected multicast games
• Minimizing Rosenthal potential in multicast games
• Multicast network design game on a ring
• Min-Cost Selfish Multicast With Network Coding
• Who should pay for forwarding packets?
• When Ignorance Helps: Graphical Multicast Cost Sharing Games
• Minimizing Rosenthal potential in multicast games
• EquiCast, scalable multicast with selfish users
• Algorithms and Computation
• Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
• When ignorance helps: graphical multicast cost sharing games

This page was built for publication: The Price of Nash Equilibria in Multicast Transmissions Games

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