Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks | Zendy

Terry E. Daniel | Zendy; Eyran J. Gisches | Zendy; Am Rapoport | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks

Author(s) -

Terry E. Daniel,

Eyran J. Gisches,

Am Rapoport

Publication year - 2009

Publication title -

american economic review

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 16.936

H-Index - 297

eISSN - 1944-7981

pISSN - 0002-8282

DOI - 10.1257/aer.99.5.2149

Subject(s) - counterintuitive , bottleneck , upstream (networking) , traverse , nash equilibrium , computer science , travel time , economics , traffic network , microeconomics , operations research , econometrics , transport engineering , computer network , mathematical optimization , operations management , mathematics , physics , geography , engineering , geodesy , quantum mechanics

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)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research