Designing fast converging cost sharing methods for multicast transmissions

DOI10.1007/s00224-009-9207-5zbMath1203.90038MaRDI QIDQ1959383

Michele Flammini, Vittorio Bilò, Luca Moscardelli, Angelo Fanelli, Giovanna Melideo

Publication date: 6 October 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9207-5

zbMATH Keywords

Nash equilibrium; algorithmic game theory; cost sharing games; multicast in communication networks

Mathematics Subject Classification ID

91A10: Noncooperative games

90B18: Communication networks in operations research

91A43: Games involving graphs

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Optimal cost sharing for capacitated facility location games, Some anomalies of farsighted strategic behavior

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New complexity results about Nash equilibria
• The price of selfish routing
• Strong equilibrium in congestion games
• Hardness results for multicast cost sharing.
• Potential games
• Approximation and collusion in multicast cost sharing
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• On a network creation game
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• A Concept of Egalitarianism Under Participation Constraints
• Convergence time to Nash equilibrium in load balancing
• The complexity of pure Nash equilibria
• CONGESTION GAMES AND POTENTIALS RECONSIDERED
• Applications of approximation algorithms to cooperative games
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Structural Information and Communication Complexity
• The Price of Nash Equilibria in Multicast Transmissions Games
• Convergence and Approximation in Potential Games
• Structural Information and Communication Complexity
• STACS 2005
• Approximation and Online Algorithms
• Equilibrium points in n -person games
• Sharing the cost of multicast transmissions