Local smoothness and the price of anarchy in splittable congestion games
From MaRDI portal
Publication:2253842
DOI10.1016/j.jet.2014.04.005zbMath1314.91013OpenAlexW2148042342MaRDI QIDQ2253842
Florian Schoppmann, Tim Roughgarden
Publication date: 13 February 2015
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2014.04.005
Related Items (22)
Cost-Sharing in Generalised Selfish Routing ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Equilibrium computation in resource allocation games ⋮ The price of anarchy in closed‐loop supply chains ⋮ Chaotic congestion games ⋮ Smart routing of electric vehicles for load balancing in smart grids ⋮ Unnamed Item ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Price of anarchy in a linear-state stochastic dynamic game ⋮ Introduction to computer science and economic theory ⋮ Opinion formation games with aggregation and negative influence ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Connections between mean-field game and social welfare optimization ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ Risk-Averse Selfish Routing ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ Designing Cost-Sharing Methods for Bayesian Games ⋮ Game efficiency through linear programming duality ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games ⋮ Chaotic triopoly game: a congestion case ⋮ Heterogeneity and chaos in congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stackelberg strategies and collusion in network games with splittable flow
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Correlated equilibrium and potential games
- Calibrated learning and correlated equilibrium
- Potential games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- A class of games possessing pure-strategy Nash equilibria
- The effect of collusion in congestion games
- The Impact of Oligopolistic Competition in Networks
- Exact Price of Anarchy for Polynomial Congestion Games
- How bad is selfish routing?
- Technical Note—Traffic Equilibrium Paradoxes
- The Price of Stability for Network Design with Fair Cost Allocation
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
- On the Inefficiency of Equilibria in Congestion Games
- Multiple Equilibrium Behaviors on Networks
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Intrinsic robustness of the price of anarchy
- How Bad is Forming Your Own Opinion?
- Coevolutionary opinion formation games
- Selfish Routing in Capacitated Networks
This page was built for publication: Local smoothness and the price of anarchy in splittable congestion games
