Distributed Learning of Equilibria in a Routing Game - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Parallel Processing Letters Year : 2009

Distributed Learning of Equilibria in a Routing Game

Abstract

We focus on the problem of learning equilibria in a particular routing game similar to the Wardrop traffic model. We describe a routing game played by a large number of players and present a distributed learning algorithm that we prove to converge weakly to equilibria for the system. The proof of convergence is based on a differential equation governing the global evolution of the system that is inferred from all the local evolutions of the agents in play. We prove that the differential equation converges with the help of Lyapunov techniques.
No file

Dates and versions

inria-00432310 , version 1 (16-11-2009)

Identifiers

Cite

Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton. Distributed Learning of Equilibria in a Routing Game. Parallel Processing Letters, 2009, 19 (2), pp.189-204. ⟨10.1142/S012962640900016X⟩. ⟨inria-00432310⟩
165 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More