Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yang, Hai & Xu, Wei & Heydecker, Benjamin, 2010. "Bounding the efficiency of road pricing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(1), pages 90-108, January.
- Roughgarden, Tim & Tardos, Eva, 2004. "Bounding the inefficiency of equilibria in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 47(2), pages 389-403, May.
- Hai Yang & Deren Han & Hong Lo, 2008. "Efficiency of Atomic Splittable Selfish Routing with Polynomial Cost Functions," Networks and Spatial Economics, Springer, vol. 8(4), pages 443-451, December.
- Correa, Jose R. & Schulz, Andreas S. & Stier Moses, Nicolas E., 2003. "Selfish Routing in Capacitated Networks," Working papers 4319-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Correa, José R. & Schulz, Andreas S. & Stier-Moses, Nicolás E., 2008. "A geometric approach to the price of anarchy in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 64(2), pages 457-469, November.
More about this item
KeywordsNash game; Inefficiency; Traffic equilibria; Elastic demand; Optimal tax;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:63:y:2014:i:c:p:31-43. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.