IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v63y2014icp31-43.html
   My bibliography  Save this article

Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands

Author

Listed:
  • Feng, Zengzhe
  • Gao, Ziyou
  • Sun, Huijun

Abstract

We determine the exact upper bound of the inefficiency of atomic splittable selfish traffic equilibria with elastic travel demand with and without road pricing. In the previous results, only pseudo-approximation bound were obtained for this case. By comparison, we also conclude that the traffic equilibrium with elastic demand may be worse than the corresponding fixed demand case, which implying that the demands’ elastic can have a negative effect on the quality of equilibrium solutions. Finally, we propose a road pricing mechanism. We prove that there are optimal tolls in general network, atomic players and elastic travel demand setting.

Suggested Citation

  • Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
  • Handle: RePEc:eee:transe:v:63:y:2014:i:c:p:31-43
    DOI: 10.1016/j.tre.2014.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554514000027
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    Full references (including those not matched with items on IDEAS)

    Corrections

    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 CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.