On Lookahead Equilibria in Congestion Games

DOI10.1007/978-3-642-45046-4_6zbMath1404.91042OpenAlexW2146603448MaRDI QIDQ2937746

Angelo Fanelli, Luca Moscardelli, Vittorio Bilò

Publication date: 12 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45046-4_6

zbMATH Keywords

congestion games\(k\)-lookahead equilibria

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (4)

On lookahead equilibria in congestion games ⋮ Dynamic resource allocation games ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Dynamic Resource Allocation Games

Cites Work

• Unnamed Item
• Unnamed Item
• On best response dynamics in weighted congestion games with polynomial delays
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted 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
• Exact Price of Anarchy for Polynomial Congestion Games
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

This page was built for publication: On Lookahead Equilibria in Congestion Games