Solving N-player dynamic routing games with congestion: a mean field approach.
Theophile CabannesMathieu LaurièreJulien PérolatRaphaël MarinierSertan GirginSarah PerrinOlivier PietquinAlexandre M. BayenÉric GoubaultRomuald EliePublished in: CoRR (2021)
Keyphrases
- dynamic routing
- load balancing
- game play
- heavy traffic
- boolean games
- travel time
- repeated games
- pure nash equilibria
- imperfect information
- two player games
- computer games
- board game
- game players
- video games
- routing algorithm
- educational games
- computer poker
- game theory
- asymptotically optimal
- combinatorial optimization
- material handling
- mobile agents
- distributed systems
- dynamic programming
- wireless sensor networks
- congestion games
- digital libraries