When ignorance helps: graphical multicast cost sharing games
From MaRDI portal
Publication:844895
DOI10.1016/J.TCS.2009.10.007zbMATH Open1185.91051OpenAlexW1982650893MaRDI QIDQ844895FDOQ844895
Authors: Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli 
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
Recommendations
Noncooperative games (91A10) Multistage and repeated games (91A20) Other game-theoretic models (91A40) Economics of information (91B44)
Cites Work
- Algorithmic Game Theory
- Title not available (Why is that?)
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- Applications of approximation algorithms to cooperative games
- Congestion games with player-specific payoff functions
- Dynamic Steiner Tree Problem
- Approximation and collusion in multicast cost sharing
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- On the value of coordination in network design
- Network formation games with local coalitions
- Title not available (Why is that?)
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Selfish Routing with Oblivious Users
- Sharing the cost of multicast transmissions
- An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
- 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
- Title not available (Why is that?)
- Structural Information and Communication Complexity
- The Price of Nash Equilibria in Multicast Transmissions Games
- Approximation and Online Algorithms
- Sharing the cost of multicast transmissions in wireless networks
Cited In (17)
- The impact of social ignorance on weighted congestion games
- Some anomalies of farsighted strategic behavior
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Bayesian ignorance
- Multicast network design game on a ring
- Graphical congestion games
- Improved bounds on equilibria solutions in the network design game
- Bayesian ignorance
- On the sequential price of anarchy of isolation games
- Local and global price of anarchy of graphical games
- On social envy-freeness in multi-unit markets
- Competitive routing over time
- When Ignorance Helps: Graphical Multicast Cost Sharing Games
- Designing networks with good equilibria under uncertainty
- Designing networks with good equilibria under uncertainty
- Social context congestion games
This page was built for publication: When ignorance helps: graphical multicast cost sharing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844895)
