This setting lets you change the way you view articles. You can choose to have articles open in a dialog window, a new tab, or directly in the same window.
Open in Dialog
Open in New Tab
Open in same window

American Economic Review: Vol. 99 No. 5 (December 2009)

Expand

Quick Tools:

Print Article Summary
Export Citation
Sign up for Email Alerts Follow us on Twitter

Explore:

AER - All Issues

AER Forthcoming Articles

Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks

Article Citation

Daniel, Terry E., Eyran J. Gisches, and Amnon Rapoport. 2009. "Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks." American Economic Review, 99(5): 2149-76.

DOI: 10.1257/aer.99.5.2149

Abstract

We study the departure time decisions of commuters traversing a traffic network with the goal of arriving at a common destination at a specified time. There are costs associated with arriving either too early or too late, and with delays experienced at bottlenecks. Our main hypothesis, based on the Nash equilibrium distribution of departure times, implies that, for certain parameter values, expanding the capacity of an upstream bottleneck can increase the total travel costs in the network. We report the results of a large-group laboratory experiment, which are strongly supportive of this counterintuitive hypothesis, and we discuss the implications. (JEL D85, R41)

Article Full-Text Access

Full-text Article

Additional Materials

Download Data Set (6.34 MB) | Appendix (790.93 KB)

Authors

Daniel, Terry E. (U Alberta)
Gisches, Eyran J. (U AZ)
Rapoport, Amnon (U AZ)

JEL Classifications

D85: Network Formation and Analysis: Theory
R41: Transportation: Demand, Supply, and Congestion; Safety and Accidents; Transportation Noise


American Economic Review


Quick Tools:

Sign up for Email Alerts

Follow us on Twitter

Subscription Information
(Institutional Administrator Access)

Explore:

AER - All Issues

AER - Forthcoming Articles

Virtual Field Journals


AEA Member Login:


AEAweb | AEA Journals | Contact Us