Network architecture and traffic flows
This paper presents theory and experiments to investigate how network architecture influences route-choice behavior by comparing outcomes across several different networks. The network changes we consider are based on abstract examples illustrating 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 direction predicted by equilibrium theory. 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.
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:||Jul 2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (44) 0115 951 5620
Fax: (0115) 951 4159
Web page: http://www.nottingham.ac.uk/economics/cedex/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:not:notcdx:2006-12. See general information about how to correct material in RePEc.
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.