The speed of convergence in congestion games under best-response dynamics
From MaRDI portal
Publication:3189066
DOI10.1145/2229163.2229169zbMath1295.91008OpenAlexW1980068415MaRDI QIDQ3189066
Angelo Fanelli, Michele Flammini, Luca Moscardelli
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2229163.2229169
Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Concurrent imitation dynamics in congestion games ⋮ Convergence of incentive-driven dynamics in Fisher markets ⋮ On the performance of mildly greedy players in cut games ⋮ On Lookahead Equilibria in Congestion Games ⋮ On lookahead equilibria in congestion games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Non-atomic one-round walks in congestion games ⋮ The return function: a new computable perspective on Bayesian-Nash equilibria ⋮ Dynamics of Profit-Sharing Games ⋮ Some anomalies of farsighted strategic behavior
This page was built for publication: The speed of convergence in congestion games under best-response dynamics