Braess's paradox for flows over time

DOI10.1007/s00224-013-9462-3zbMath1305.91050arXiv1007.4864OpenAlexW2114282507MaRDI QIDQ372993

Martin Macko, Kate Larson, Ľuboš Steskal

Publication date: 21 October 2013

Published in: Theory of Computing Systems, Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4864

zbMATH Keywords

congestion gamesflows over timeselfish routingBraess's paradoxdynamic flows

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Other game-theoretic models (91A40) Graph minors (05C83) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ On the Price of Anarchy for Flows over Time ⋮ Existence and Uniqueness of Equilibria for Flows over Time ⋮ Competitive routing over time ⋮ A Stackelberg strategy for routing flow over time ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Bounding Residence Times for Atomic Dynamic Routings

Cites Work

• Network topology and the efficiency of equilibrium
• Topology of series-parallel networks
• On the severity of Braess's paradox: designing networks for selfish users is hard
• How bad is selfish routing?
• Nash Equilibria and the Price of Anarchy for Flows over Time
• On the relationship between Nash—Cournot and Wardrop equilibria
• Constructing Maximal Dynamic Flows from Static Flows
• Über ein Paradoxon aus der Verkehrsplanung
• Unnamed Item
• Unnamed Item

This page was built for publication: Braess's paradox for flows over time