IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v13y1979i3p237-242.html
   My bibliography  Save this article

The marginal cost taxation of a transportation network

Author

Listed:
  • Smith, M. J.

Abstract

The paper shows that if the cost and demand functions satisfy certain weak smoothness conditions then the marginal cost taxation of a transportation network is optimal in the usual local sense. Interactions between the cost of travel along a link and flow along other links and between the demand for travel along a route and flow along other routes are permitted.

Suggested Citation

  • Smith, M. J., 1979. "The marginal cost taxation of a transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 237-242, September.
  • Handle: RePEc:eee:transb:v:13:y:1979:i:3:p:237-242
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(79)90015-8
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dial, Robert B., 1999. "Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case," Transportation Research Part B: Methodological, Elsevier, vol. 33(3), pages 189-202, April.
    2. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    3. Chinmay Maheshwari & Kshitij Kulkarni & Druv Pai & Jiarui Yang & Manxi Wu & Shankar Sastry, 2024. "Congestion Pricing for Efficiency and Equity: Theory and Applications to the San Francisco Bay Area," Papers 2401.16844, arXiv.org.
    4. Clegg, Janet & Smith, Mike & Xiang, Yanling & Yarrow, Robert, 2001. "Bilevel programming applied to optimising urban transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 41-70, January.
    5. Gentile, Guido & Papola, Natale & Persia, Luca, 2005. "Advanced pricing and rationing policies for large scale multimodal networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(7-9), pages 612-631.
    6. Chen, Mei & Bernstein, David H., 2004. "Solving the toll design problem with multiple user groups," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 61-79, January.
    7. Zhang, Xiaoning & Yang, Hai & Huang, Hai-Jun, 2008. "Multiclass multicriteria mixed equilibrium on networks and uniform link tolls for system optimum," European Journal of Operational Research, Elsevier, vol. 189(1), pages 146-158, August.
    8. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2002. "Network pricing optimization in multi-user and multimodal context with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 779-798, November.
    9. Takeshi Nagae & Takashi Akamatsu, 2006. "Dynamic Revenue Management of a Toll Road Project under Transportation Demand Uncertainty," Networks and Spatial Economics, Springer, vol. 6(3), pages 345-357, September.
    10. Yang, Hai & Zhang, Xiaoning, 2008. "Existence of anonymous link tolls for system optimum on networks with mixed equilibrium behaviors," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 99-112, February.
    11. Mehrdad Gholami Shahbandi & Mohammad Mahdi Nasiri & Abbas Babazadeh, 2015. "A quantum evolutionary algorithm for the second-best congestion pricing problem in urban traffic networks," Transportation Planning and Technology, Taylor & Francis Journals, vol. 38(8), pages 851-865, December.
    12. Yang, Hai & Hai-Jun, Huang, 1997. "Analysis of the time-varying pricing of a bottleneck with elastic demand using optimal control theory," Transportation Research Part B: Methodological, Elsevier, vol. 31(6), pages 425-440, November.
    13. Wie, Byung-Wook & Tobin, Roger L., 1998. "Dynamic congestion pricing models for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(5), pages 313-327, June.
    14. Tobias Harks & Konstantin Miller, 2011. "The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games," Operations Research, INFORMS, vol. 59(6), pages 1491-1503, December.
    15. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    16. Tobias Harks & Max Klimm, 2016. "Congestion Games with Variable Demands," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 255-277, February.
    17. Itai Arieli, 2015. "Transfer Implementation in Congestion Games," Dynamic Games and Applications, Springer, vol. 5(2), pages 228-238, June.
    18. Yan, Hai & Lam, William H. K., 1996. "Optimal road tolls under conditions of queueing and congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 319-332, September.
    19. Dial, Robert B., 2000. "Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 645-665, November.
    20. Fabio Bagagiolo & Silvia Faggian & Rosario Maggistro & Raffaele Pesenti, 2022. "Optimal Control of the Mean Field Equilibrium for a Pedestrian Tourists’ Flow Model," Networks and Spatial Economics, Springer, vol. 22(2), pages 243-266, June.

    More about this item

    Statistics

    Access and download statistics

    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:transb:v:13:y:1979:i:3:p:237-242. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.