On lookahead equilibria in congestion games

DOI10.1017/S0960129515000079zbMath1364.91012OpenAlexW2566709761MaRDI QIDQ2971063

Luca Moscardelli, Vittorio Bilò, Angelo Fanelli

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000079

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (2)

A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence to approximate Nash equilibria in congestion games
• On best response dynamics in weighted congestion games with polynomial delays
• Potential games
• Some anomalies of farsighted strategic behavior
• A class of games possessing pure-strategy Nash equilibria
• A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
• On Lookahead Equilibria in Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• The speed of convergence in congestion games under best-response dynamics
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• A Theoretical Examination of Practical Game Playing: Lookahead Search
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

This page was built for publication: On lookahead equilibria in congestion games