| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898354 | European Journal of Operational Research | 2012 | 8 Pages |
Abstract
⺠This paper studies the cost sharing problem for highways with consecutive segments. ⺠We propose a rule satisfying Additivity, Dummy, Toll Upper Bound and Routing-proofness. ⺠It is the only method satisfying Routing-proofness and Cost Recovery Axioms. ⺠The rule is the Shapley value when traffic is normalized for any segment. ⺠The rule coincides with landing fee solution if all vehicles exit at last exit.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Baomin Dong, Guixia Guo, Yuntong Wang,