Approximating Wardrop equilibria with finitely many agents
From MaRDI portal
Publication:352247
DOI10.1007/S00446-008-0057-1zbMATH Open1267.68308OpenAlexW1997173893MaRDI QIDQ352247FDOQ352247
Lars Olbrich, Simon Fischer, Berthold Vöcking
Publication date: 4 July 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-008-0057-1
Recommendations
- Approximating Wardrop Equilibria with Finitely Many Agents
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
- Wardrop equilibrium on time-varying graphs
Cites Work
- Title not available (Why is that?)
- How much can taxes help selfish routing?
- How bad is selfish routing?
- Fast convergence of selfish rerouting
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- A guided tour of Chernoff bounds
- Title not available (Why is that?)
- Routing without regret
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Title not available (Why is that?)
- Adaptive routing with end-to-end feedback
- Distributed selfish load balancing
- Network Games with Atomic Players
- Title not available (Why is that?)
- Adaptive routing with stale information
- Greedy distributed optimization of multi-commodity flows
- Automata, Languages and Programming
Cited In (5)
This page was built for publication: Approximating Wardrop equilibria with finitely many agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352247)
