Nash Equilibria and the Price of Anarchy for Flows over Time
From MaRDI portal
Publication:3648867
DOI10.1007/978-3-642-04645-2_29zbMath1262.90026OpenAlexW3012394743MaRDI QIDQ3648867
Publication date: 1 December 2009
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04645-2_29
Applications of game theory (91A80) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) General equilibrium theory (91B50)
Related Items (8)
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game ⋮ Braess's paradox for flows over time ⋮ Equilibria in routing games with edge priorities ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Existence and Uniqueness of Equilibria for Flows over Time ⋮ Competitive routing over time ⋮ Bounding Residence Times for Atomic Dynamic Routings
This page was built for publication: Nash Equilibria and the Price of Anarchy for Flows over Time
