Approximating Wardrop Equilibria with Finitely Many Agents
From MaRDI portal
Publication:3523211
DOI10.1007/978-3-540-75142-7_20zbMATH Open1145.68353OpenAlexW1606242515MaRDI QIDQ3523211FDOQ3523211
Authors: Simon Fischer, Lars Olbrich, Berthold Vöcking 
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
Recommendations
- Approximating Wardrop equilibria with finitely many agents
- Existence of equilibrium with nonconvexities and finitely many agents
- Bounding the inefficiency of Nash equilibria in games with finitely many players
- An Improved Bound for Approximate Equilibria
- Approximations of Nash equilibria
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- Approximating Nash equilibria in nonzero-sum games
- An optimization approach for approximate Nash equilibria
Distributed algorithms (68W15) Stochastic network models in operations research (90B15) Games involving graphs (91A43) Distributed systems (68M14)
Cited In (11)
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Computing all Wardrop equilibria parametrized by the flow demand
- Title not available (Why is that?)
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- Management of Variable Data Streams in Networks
- Existence of equilibrium with nonconvexities and finitely many agents
- Approximating Wardrop equilibria with finitely many agents
- Wardrop equilibrium on time-varying graphs
- Atomic dynamic flow games: adaptive vs. nonadaptive agents
- Distributed Learning of Wardrop Equilibria
- Fast convergence to Wardrop equilibria by adaptive sampling methods
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 Q3523211)
