The Price of Nash Equilibria in Multicast Transmissions Games
From MaRDI portal
Publication:5387773
DOI10.1007/978-3-540-77120-3_35zbMath1193.68024MaRDI QIDQ5387773
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
91A10: Noncooperative games
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
When ignorance helps: graphical multicast cost sharing games, Designing fast converging cost sharing methods for multicast transmissions
Cites Work
- Unnamed Item
- Unnamed Item
- Sharing the cost of multicast transmissions in wireless networks
- Hardness results for multicast cost sharing.
- Approximation and collusion in multicast cost sharing
- Non-cooperative games
- Sharing the cost of muliticast transmissions (preliminary version)
- Near-optimal network design with selfish agents
- Applications of approximation algorithms to cooperative games
- Structural Information and Communication Complexity
- Algorithms and Computation
- Approximation and Online Algorithms
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
- Equilibrium points in n -person games
- Strategyproof sharing of submodular costs: budget balance versus efficiency
