Approximating Wardrop Equilibria with Finitely Many Agents

DOI10.1007/978-3-540-75142-7_20zbMath1145.68353OpenAlexW1606242515MaRDI QIDQ3523211

Lars Olbrich, Berthold Vöcking, Simon Fischer

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_20

Mathematics Subject Classification ID

Games involving graphs (91A43) Stochastic network models in operations research (90B15) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Distributed Learning of Wardrop Equilibria ⋮ Management of Variable Data Streams in Networks ⋮ Models of Non-atomic Congestion Games – From Unicast to Multicast Routing

This page was built for publication: Approximating Wardrop Equilibria with Finitely Many Agents