Network Architecture and Traffic Flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes
AbstractThis 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.
Bibliographic InfoPaper provided by The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham in its series Discussion Papers with number 2007-05.
Date of creation: Aug 2007
Date of revision:
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
Other versions of this item:
- Morgan, John & Orzen, Henrik & Sefton, Martin, 2009. "Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes," Games and Economic Behavior, Elsevier, vol. 66(1), pages 348-372, May.
- John Morgan & Henrik Orzen & Martin Sefton, 2007. "Network Architecture and Traffic Flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes," Discussion Papers 2007-05, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Terry E. Daniel & Eyran J. Gisches & Amnon Rapoport, 2009. "Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks," American Economic Review, American Economic Association, vol. 99(5), pages 2149-76, December.
- Eyran Gisches & Amnon Rapoport, 2012. "Degrading network capacity may improve performance: private versus public monitoring in the Braess Paradox," Theory and Decision, Springer, vol. 73(2), pages 267-293, August.
- Arvidsson, Niklas, 2013. "The milk run revisited: A load factor paradox with economic and environmental implications for urban freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 51(C), pages 56-62.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Suzanne Robey).
If references are entirely missing, you can add them using this form.