On the convergence of multicast games in directed networks
From MaRDI portal
Publication:2379922
DOI10.1007/s00453-008-9212-0zbMath1184.68122OpenAlexW1993460328MaRDI QIDQ2379922
Luca Moscardelli, Angelo Fanelli, Michele Flammini
Publication date: 23 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9212-0
price of anarchylimited number of best-response movesmulticast gamesnon-cooperative networksshapley cost allocation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New complexity results about Nash equilibria
- 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
- Sharing the cost of muliticast transmissions (preliminary version)
- 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
- Dynamic Steiner Tree Problem
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Applications of approximation algorithms to cooperative games
- The price of selfish routing
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Structural Information and Communication Complexity
- Convergence and Approximation in Potential Games
- Structural Information and Communication Complexity
- STACS 2005
- Approximation and Online Algorithms
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
- Equilibrium points in n -person games
This page was built for publication: On the convergence of multicast games in directed networks
