Choice of routes in congested traffic networks: Experimental tests of the Braess paradox

DOI10.1016/j.geb.2008.02.007zbMath1156.90453OpenAlexW3123415338MaRDI QIDQ1007778

Amnon Rapoport, Eyran J. Gisches, Tamar Kugler, Subhasish Dugar

Publication date: 24 March 2009

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2008.02.007

zbMATH Keywords

experimentsroute choiceBraess paradoxcongested traffic networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

An experiment on lowest unique integer games ⋮ Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games ⋮ Braess paradox in a network with stochastic dynamics and fixed strategies ⋮ Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox ⋮ Dynamics in braess paradox with nonimpulsive commuters ⋮ Chaotic behavior of traffic-flow evolution with two departure intervals in two-link transportation network ⋮ Locating inefficient links in a large-scale transportation network ⋮ Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes ⋮ Braess’ paradox in the age of traffic information

Cites Work

• Unnamed Item
• How bad is selfish routing?
• The Prevalence of Paradoxes in Transportation Equilibrium Problems
• The Braess paradox
• Network routing
• Algorithms, games, and the internet
• Über ein Paradoxon aus der Verkehrsplanung
• A paradox of congestion in a queuing network

This page was built for publication: Choice of routes in congested traffic networks: Experimental tests of the Braess paradox