Fast convergence to Wardrop equilibria by adaptive sampling methods
From MaRDI portal
Recommendations
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
- Approximating Wardrop Equilibria with Finitely Many Agents
- Approximating Wardrop equilibria with finitely many agents
- Distributed Learning of Wardrop Equilibria
Cited in
(17)- Greedy distributed optimization of multi-commodity flows
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Approximating Wardrop equilibria with finitely many agents
- Distributed Learning of Wardrop Equilibria
- Traffic Networks and Flows over Time
- Management of Variable Data Streams in Networks
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Atomic Congestion Games: Fast, Myopic and Concurrent
- The Price of Stochastic Anarchy
- Convergence to approximate Nash equilibria in congestion games
- Memory loss can prevent chaos in games dynamics
- Load balancing without regret in the bulletin board model
- On the discrete-time origins of the replicator dynamics: from convergence to instability and chaos
- Congestion games with malicious players
- Adaptive routing with stale information
- Atomic congestion games: fast, myopic and concurrent
This page was built for publication: Fast convergence to Wardrop equilibria by adaptive sampling methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931425)
