Network Architecture and Traffic Flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes
This paper presents theory and experiments to investigate how network architecture influences route-choice behavior. We consider changes to networks that, theoretically, exhibit the Pigou- Knight-Downs and Braess Paradoxes. We show that these paradoxes are specific examples of more general classes of network change properties that we term the “least congestible route” and “size” principles, respectively. We find that technical improvements to networks induce adjustments in traffic flows. In the case of network changes based on the Pigou-Knight-Downs Paradox, these adjustments undermine short-term payoff improvements. In the case of network changes based on the Braess Paradox, these adjustments reinforce the counter-intuitive, but theoretically predicted, effect of reducing payoffs to network users. Although aggregate traffic flows are close to equilibrium levels, we see some systematic deviations from equilibrium. We show that the qualitative features of these discrepancies can be accounted for by a simple reinforcement learning model.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Aug 2007|
|Contact details of provider:|| Postal: School of Economics University of Nottingham University Park Nottingham NG7 2RD|
Phone: (44) 0115 951 5620
Fax: (0115) 951 4159
Web page: http://www.nottingham.ac.uk/economics/cedex/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Penchina, Claude M., 1997. "Braess paradox: Maximum penalty in a minimal critical network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 31(5), pages 379-388, September.
- Hartman, John Lawrence, 2007. "The Relevance of Heterogeneity in a Congested Route Network with Tolls: An Analysis of Two Experiments Using Actual Waiting Times and Monetized Time Costs," University of California at Santa Barbara, Economics Working Paper Series qt22b46341, Department of Economics, UC Santa Barbara.
- Erel Avineri & Joseph Prashker, 2006. "The Impact of Travel Time Information on Travelers’ Learning under Uncertainty," Transportation, Springer, vol. 33(4), pages 393-408, July.
- Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-881, September.
- Pas, Eric I. & Principio, Shari L., 1997. "Braess' paradox: Some new insights," Transportation Research Part B: Methodological, Elsevier, vol. 31(3), pages 265-276, June.
- Iida, Yasunori & Akiyama, Takamasa & Uchida, Takashi, 1992. "Experimental analysis of dynamic route choice behavior," Transportation Research Part B: Methodological, Elsevier, vol. 26(1), pages 17-32, February.
- Hartman, John Lawrence, 2007. "A Route Choice Experiment With an Efficient Toll," University of California at Santa Barbara, Economics Working Paper Series qt4s1116mv, Department of Economics, UC Santa Barbara.
- Glenn Ellison & Drew Fudenberg & Markus Möbius, 2004.
Journal of the European Economic Association,
MIT Press, vol. 2(1), pages 30-66, March.
- Glenn Allison & Drew Fudenberg, 2002. "Competing Auctions," Harvard Institute of Economic Research Working Papers 1960, Harvard - Institute of Economic Research.
- Ellison, Glenn & Fudenberg, Drew & Mobius, Markus, 2010. "Competing Auctions," Staff General Research Papers Archive 32106, Iowa State University, Department of Economics.
- Glenn Ellison & Drew Fudenberg & Markus Mobius, 2010. "Competing Auctions," Levine's Working Paper Archive 506439000000000092, David K. Levine.
- Ellison, Glenn & Mobius, Markus & Fudenberg, Drew, 2004. "Competing Auctions," Scholarly Articles 3043414, Harvard University Department of Economics.
- Anthony Ziegelmeyer & Frédéric Koessler & Kene Boun My & Laurent Denant-Boèmont, 2008. "Road Traffic Congestion and Public Information: An Experimental Investigation," Journal of Transport Economics and Policy, University of Bath, vol. 42(1), pages 43-82, January.
- Kene Boun My & Laurent Denant-Boèmont & Frédéric Koessler & Marc Willinger & Anthony Ziegelmeyer, 2006. "Road Traffic Congestion and Public Information: An Experimental Investigation," Papers on Strategic Interaction 2006-20, Max Planck Institute of Economics, Strategic Interaction Group.
- Anthony Ziegelmeyer & Frédéric Koessler & Kene Boun My & Laurent Denant-Boèmont, 2008. "Road traffic congestion and public information : an experimental investigation," Post-Print halshs-00333755, HAL.
- Anthony Ziegelmeyer & Frédéric Koessler & Kene Boun My & Laurent Denant-Boèmont, 2007. "Road Traffic Congestion and Public Information: An Experimental Investigation," THEMA Working Papers 2007-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Selten, R. & Chmura, T. & Pitz, T. & Kube, S. & Schreckenberg, M., 2007. "Commuters route choice behaviour," Games and Economic Behavior, Elsevier, vol. 58(2), pages 394-406, February.
- Milchtaich, Igal, 1996. "Congestion Games with Player-Specific Payoff Functions," Games and Economic Behavior, Elsevier, vol. 13(1), pages 111-124, March.
- Rapoport, Amnon & Mak, Vincent & Zwick, Rami, 2006. "Navigating congested networks with variable demand: Experimental evidence," Journal of Economic Psychology, Elsevier, vol. 27(5), pages 648-666, October.
- Horowitz, Joel L., 1984. "The stability of stochastic equilibrium in a two-link transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 18(1), pages 13-28, February. Full references (including those not matched with items on IDEAS)