When ignorance helps: graphical multicast cost sharing games
From MaRDI portal
Publication:844895
DOI10.1016/j.tcs.2009.10.007zbMath1185.91051OpenAlexW1982650893MaRDI QIDQ844895
Luca Moscardelli, Michele Flammini, Vittorio Bilò, Angelo Fanelli
Publication date: 5 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.007
Noncooperative games (91A10) Other game-theoretic models (91A40) Economics of information (91B44) Multistage and repeated games (91A20)
Related Items (12)
Multicast Network Design Game on a Ring ⋮ Social context congestion games ⋮ Unnamed Item ⋮ Local and global price of anarchy of graphical games ⋮ Graphical congestion games ⋮ Improved bounds on equilibria solutions in the network design game ⋮ The impact of social ignorance on weighted congestion games ⋮ Competitive routing over time ⋮ On social envy-freeness in multi-unit markets ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Some anomalies of farsighted strategic behavior ⋮ On the sequential price of anarchy of isolation games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- Near-optimal network design with selfish agents
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the Value of Coordination in Network Design
- Dynamic Steiner Tree Problem
- Applications of approximation algorithms to cooperative games
- Structural Information and Communication Complexity
- The Price of Nash Equilibria in Multicast Transmissions Games
- Network formation games with local coalitions
- Selfish Routing with Oblivious Users
- Algorithmic Game Theory
- Approximation and Online Algorithms
- Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
- Sharing the cost of multicast transmissions
This page was built for publication: When ignorance helps: graphical multicast cost sharing games
