Distributed learning of equilibria in a routing game

DOI10.1142/S012962640900016XMaRDI QIDQ6483529zbMATH OpenFDO

Authors D. Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton

Publication date 29 September 2010

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012962640900016X

zbMATH Keywords

learning algorithmLyapunov stabilityNash equilibriarouting gameweak convergence

Mathematics Subject Classification ID

Characteristic and Lyapunov exponents of ordinary differential equations (34D08) Distributed systems (68M14) Learning and adaptive systems in artificial intelligence (68T05) Rationality and learning in game theory (91A26)

Recommendations

• Distributed Learning of Wardrop Equilibria
• Social learning in nonatomic routing games
• Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
• Online learning of Nash equilibria in congestion games

Cited in

(9)

• Social learning in nonatomic routing games
• A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game
• On the stability of an adaptive learning dynamics in traffic games
• Distributed Learning of Wardrop Equilibria
• scientific article; zbMATH DE number 3896627 (Why is no real title available?)
• Learning efficient Nash equilibria in distributed systems
• A note on social learning in non-atomic routing games
• On the convergence of distributed projected gradient play with heterogeneous learning rates in monotone games
• A payoff-based learning procedure and its application to traffic games

This page was built for publication: Distributed learning of equilibria in a routing game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483529)