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

Highway toll allocation

Author

Listed:
  • Wu, Hao
  • van den Brink, René
  • Estévez-Fernández, Arantza

Abstract

An important operational aspect in the management of tolled highways is how the collected tolls should be allocated over the different highway segments, either operated by different operators or by different units of one operator. This paper analyzes this toll allocation problem both from an axiomatic and a game theoretic perspective. Based on different toll charging systems, specifically the distance-based toll system and the fixed toll system, we propose three allocation or sharing methods: the Segments Equal Sharing method, the Exits Equal Sharing method, and the Entrances Equal Sharing method. After direct and game theoretic characterizations of these methods, we apply them to several real-life highways.

Suggested Citation

  • Wu, Hao & van den Brink, René & Estévez-Fernández, Arantza, 2024. "Highway toll allocation," Transportation Research Part B: Methodological, Elsevier, vol. 180(C).
    • Handle: RePEc:eee:transb:v:180:y:2024:i:c:s0191261524000134
    DOI: 10.1016/j.trb.2024.102889
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261524000134
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2024.102889?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On how to allocate the fixed cost of transport systems," Annals of Operations Research, Springer, vol. 301(1), pages 81-105, June.
    2. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1994. "Sequencing and cooperation," Other publications TiSEM be67f9e9-7a4a-47f1-9fb9-7, Tilburg University, School of Economics and Management.
    3. Alcalde-Unzu, Jorge & Gómez-Rúa, María & Molis, Elena, 2015. "Sharing the costs of cleaning a river: the Upstream Responsibility rule," Games and Economic Behavior, Elsevier, vol. 90(C), pages 134-150.
    4. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    5. Gilles, Robert P & Owen, Guillermo & van den Brink, Rene, 1992. "Games with Permission Structures: The Conjunctive Approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 277-293.
    6. Chen, Daqiang & Ignatius, Joshua & Sun, Danzhi & Goh, Mark & Zhan, Shalei, 2018. "Impact of congestion pricing schemes on emissions and temporal shift of freight transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 77-105.
    7. Imma Curiel & Jos Potters & Rajendra Prasad & Stef Tijs & Bart Veltman, 1994. "Sequencing and Cooperation," Operations Research, INFORMS, vol. 42(3), pages 566-568, June.
    8. van den Brink, Rene & Gilles, Robert P., 1996. "Axiomatizations of the Conjunctive Permission Value for Games with Permission Structures," Games and Economic Behavior, Elsevier, vol. 12(1), pages 113-126, January.
    9. Algaba, Encarnación & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Horizontal cooperation in a multimodal public transport system: The profit allocation problem," European Journal of Operational Research, Elsevier, vol. 275(2), pages 659-665.
    10. Gilles, R.P. & Owen, G., 1999. "Cooperative Games and Disjunctive Permission Structures," Other publications TiSEM 4f162187-3069-4cb5-8353-5, Tilburg University, School of Economics and Management.
    11. Baomin Dong & Debing Ni & Yuntong Wang, 2012. "Sharing a Polluted River Network," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 53(3), pages 367-387, November.
    12. Dong, Baomin & Guo, Guixia & Wang, Yuntong, 2012. "Highway toll pricing," European Journal of Operational Research, Elsevier, vol. 220(3), pages 744-751.
    13. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    14. Gilles, R.P. & Owen, G., 1999. "Cooperative Games and Disjunctive Permission Structures," Discussion Paper 1999-20, Tilburg University, Center for Economic Research.
    15. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
    16. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    17. Gabrielle Demange, 2004. "On Group Stability in Hierarchies and Networks," Journal of Political Economy, University of Chicago Press, vol. 112(4), pages 754-778, August.
    18. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1993. "Cooperation in one machine scheduling," Other publications TiSEM 9c5ceec5-2080-4b5c-98d5-0, Tilburg University, School of Economics and Management.
    19. van den Brink, René & He, Simin & Huang, Jia-Ping, 2018. "Polluted river problems and games with a permission structure," Games and Economic Behavior, Elsevier, vol. 108(C), pages 182-205.
    20. Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.
    21. Sudhölter, Peter & Zarzuelo, José M., 2017. "Characterizations of highway toll pricing methods," European Journal of Operational Research, Elsevier, vol. 260(1), pages 161-170.
    22. Xiao, Feng & Shen, Wei & Michael Zhang, H., 2012. "The morning commute under flat toll and tactical waiting," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1346-1359.
    23. Ni, Debing & Wang, Yuntong, 2007. "Sharing a polluted river," Games and Economic Behavior, Elsevier, vol. 60(1), pages 176-186, July.
    24. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    25. Hou, Dongshuang & Sun, Panfei & Yang, Guangjing, 2020. "Sharing the costs of cleanup polluted river: Upstream compensation method," Economics Letters, Elsevier, vol. 195(C).
    26. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 349-364, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Gómez-Rodríguez, Marcos & Davila-Pena, Laura & Casas-Méndez, Balbina, 2024. "Cost allocation problems on highways with grouped users," European Journal of Operational Research, Elsevier, vol. 316(2), pages 667-679.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hao Wu & Rene van den Brink & Arantza Estevez-Fernandez, 2022. "Highway toll allocation," Tinbergen Institute Discussion Papers 22-036/II, Tinbergen Institute.
    2. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    3. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    4. Subhadip Chakrabarti & Amandine Ghintran & Rajnish Kumar, 2019. "Assignment of heterogeneous agents in trees under the permission value," Review of Economic Design, Springer;Society for Economic Design, vol. 23(3), pages 155-188, December.
    5. René Brink, 2012. "On hierarchies and communication," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 721-735, October.
    6. van den Brink, René & He, Simin & Huang, Jia-Ping, 2018. "Polluted river problems and games with a permission structure," Games and Economic Behavior, Elsevier, vol. 108(C), pages 182-205.
    7. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    8. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Tvede, Mich & Østerdal, Lars Peter, 2017. "Sharing the proceeds from a hierarchical venture," Games and Economic Behavior, Elsevier, vol. 102(C), pages 98-110.
    9. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    10. René Brink & Chris Dietz, 2014. "Games with a local permission structure: separation of authority and value generation," Theory and Decision, Springer, vol. 76(3), pages 343-361, March.
    11. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, December.
    12. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    13. Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(4), pages 697-718, November.
    14. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    15. David Lowing, 2023. "Allocation rules for multi-choice games with a permission tree structure," Annals of Operations Research, Springer, vol. 320(1), pages 261-291, January.
    16. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    17. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Other publications TiSEM 00f2df6e-3a8e-4ed3-84cf-2, Tilburg University, School of Economics and Management.
    18. Sylvain Béal & Eric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 157-178, February.
    19. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    20. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    21. Algaba, A. & Bilbao, J.M. & van den Brink, J.R. & Jiménez-Losada, A., 2000. "Cooperative Games on Antimatroids," Other publications TiSEM 907b4b44-90f9-4faa-9473-8, Tilburg University, School of Economics and Management.

    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:180:y:2024:i:c:s0191261524000134. 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.

    If CitEc recognized a bibliographic 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.

    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.