The Price of Nash Equilibria in Multicast Transmissions Games
From MaRDI portal
Publication:5387773
DOI10.1007/978-3-540-77120-3_35zbMATH Open1193.68024OpenAlexW1598533245MaRDI QIDQ5387773FDOQ5387773
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
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
Graph theory (including graph drawing) in computer science (68R10) Noncooperative games (91A10) Network design and communication in computer systems (68M10)
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- Worst-case equilibria
- A course in game theory.
- Applications of approximation algorithms to cooperative games
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Approximation and collusion in multicast cost sharing
- Near-optimal network design with selfish agents
- Hardness results for multicast cost sharing.
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
- Approximation and Online Algorithms
- Sharing the cost of multicast transmissions in wireless networks
- Sharing the cost of muliticast transmissions (preliminary version)
- Structural Information and Communication Complexity
- Algorithms and Computation
Cited In (12)
- On the price of stability of undirected multicast games
- When ignorance helps: graphical multicast cost sharing games
- Minimizing Rosenthal potential in multicast games
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
- Multicast network design game on a ring
- EquiCast, scalable multicast with selfish users
- Who should pay for forwarding packets?
- On the convergence of multicast games in directed networks
- Algorithms and Computation
- Designing fast converging cost sharing methods for multicast transmissions
- Min-Cost Selfish Multicast With Network Coding
- 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)
