Fast convergence to Wardrop equilibria by adaptive sampling methods
From MaRDI portal
Publication:2931425
DOI10.1145/1132516.1132608zbMath1300.91008OpenAlexW2113154285MaRDI QIDQ2931425
Simon Fischer, Harald Räcke, Berthold Vöcking
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132608
Games with infinitely many players (91A07) Other game-theoretic models (91A40) Evolutionary games (91A22)
Related Items (14)
Congestion games with malicious players ⋮ Adaptive routing with stale information ⋮ Greedy distributed optimization of multi-commodity flows ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ Distributed Learning of Wardrop Equilibria ⋮ Load balancing without regret in the bulletin board model ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ The Price of Stochastic Anarchy ⋮ Traffic Networks and Flows over Time ⋮ Management of Variable Data Streams in Networks ⋮ Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
This page was built for publication: Fast convergence to Wardrop equilibria by adaptive sampling methods
