Greediness and equilibrium in congestion games
From MaRDI portal
Publication:2453056
DOI10.1016/j.econlet.2013.10.005zbMath1288.91013arXiv1111.6156OpenAlexW2127379300MaRDI QIDQ2453056
Rann Smorodinsky, Sergey Kuniavsky
Publication date: 6 June 2014
Published in: Economics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.6156
Related Items
Mechanisms for (mis)allocating scientific credit, Congestion games viewed from M-convexity, Internalization of social cost in congestion games
Cites Work
- Network topology and the efficiency of equilibrium
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Network structure and strong equilibrium in route selection games.
- Potential games
- A class of games possessing pure-strategy Nash equilibria
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Epistemic Conditions for Nash Equilibrium
- Approximation and Online Algorithms