Highway toll allocation problem revisited: new methods and characterizations
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908426779492352 |
|---|---|
| author | Soto-Rodríguez, P. Casas-Méndez, B. Saavedra-Nieves, A. |
| author_facet | Soto-Rodríguez, P. Casas-Méndez, B. Saavedra-Nieves, A. |
| contents | This paper considers the highway toll allocation problem (Wu, van den Brink, and Estévez-Fernández in Transport Res B-Meth 180:10288, 2024). The aim is to allocate the tolls collected from the users of a highway across the various road sections. To this end, the authors propose, among others, the Segments Equal Sharing method, which is characterized and reinterpreted as a specific solution of a cooperative game associated with the problem. This paper presents two new allocation rules: the Segments Proportional Sharing method and the Segments Compensated Sharing method. We axiomatically characterize these new methods and compare their properties to those of the Segments Equal Sharing method. Furthermore, we also examine the relationship of these methods to the solution of the associated cooperative game. We conclude the methodological study by introducing a general family of segment allocation methods that includes the three aforementioned rules. Finally, we evaluate the performance of these methods using a real-world dataset. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_22475 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Highway toll allocation problem revisited: new methods and characterizations Soto-Rodríguez, P. Casas-Méndez, B. Saavedra-Nieves, A. Optimization and Control Computer Science and Game Theory 91A12, 91A43, 91A80 This paper considers the highway toll allocation problem (Wu, van den Brink, and Estévez-Fernández in Transport Res B-Meth 180:10288, 2024). The aim is to allocate the tolls collected from the users of a highway across the various road sections. To this end, the authors propose, among others, the Segments Equal Sharing method, which is characterized and reinterpreted as a specific solution of a cooperative game associated with the problem. This paper presents two new allocation rules: the Segments Proportional Sharing method and the Segments Compensated Sharing method. We axiomatically characterize these new methods and compare their properties to those of the Segments Equal Sharing method. Furthermore, we also examine the relationship of these methods to the solution of the associated cooperative game. We conclude the methodological study by introducing a general family of segment allocation methods that includes the three aforementioned rules. Finally, we evaluate the performance of these methods using a real-world dataset. |
| title | Highway toll allocation problem revisited: new methods and characterizations |
| topic | Optimization and Control Computer Science and Game Theory 91A12, 91A43, 91A80 |
| url | https://arxiv.org/abs/2506.22475 |