Social context congestion games
From MaRDI portal
Publication:386894
DOI10.1016/J.TCS.2012.10.041zbMath1281.91012OpenAlexW2095333577MaRDI QIDQ386894
Alessandro Celi, Michele Flammini, Vittorio Bilò, Vasco Gallotti
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.041
Related Items (5)
Altruistic Hedonic Games ⋮ Additively separable hedonic games with social context ⋮ Scheduling games with rank-based utilities ⋮ Inefficiency of games with social context ⋮ The price of anarchy of affine congestion games with similar strategies
Cites Work
- Unnamed Item
- Graphical congestion games
- Tight bounds for selfish and greedy load balancing
- When ignorance helps: graphical multicast cost sharing games
- Selfish load balancing and atomic congestion games
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Potential games
- Selfish routing with incomplete information
- A class of games possessing pure-strategy Nash equilibria
- The effect of collusion in congestion games
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
- The small-world phenomenon
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish Load Balancing Under Partial Knowledge
- On the Price of Stability for Undirected Network Design
- The price of anarchy of finite congestion games
- Atomic Congestion Games Among Coalitions
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Selfish Routing with Oblivious Users
- Algorithmic Game Theory
- Algorithms – ESA 2005
- The Price of Routing Unsplittable Flow
This page was built for publication: Social context congestion games
