Distributed Learning of Wardrop Equilibria
From MaRDI portal
Publication:3543331
DOI10.1007/978-3-540-85194-3_5zbMath1166.90317OpenAlexW99061237MaRDI QIDQ3543331
Octave Boussaton, Johanne Cohen, Dominique Barith, Olivier Bournez
Publication date: 2 December 2008
Published in: Unconventional Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85194-3_5
Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80) Traffic problems in operations research (90B20) Distributed algorithms (68W15)
Related Items
Self-fulfilling signal of an endogenous state in network congestion games ⋮ Wardrop equilibrium on time-varying graphs ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
Cites Work
- On the rate of convergence of continuous-time fictitious play
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Best response dynamics for continuous zero-sum games
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- How bad is selfish routing?
- Approximating Wardrop Equilibria with Finitely Many Agents
- Convergence time to Nash equilibrium in load balancing
- Distributed selfish load balancing
- Network Games with Atomic Players
- Evolutionary game dynamics
- Adaptive routing with stale information
- Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- Equilibrium points in n -person games
- Atomic resource sharing in noncooperative networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
