| Title: |
Sharing the cost of hazardous transportation networks and the Priority Shapley value for multi-choice games: Sharing the cost of hazardous transportation...: S. Béal et al. |
| Authors: |
Béal, Sylvain1 (AUTHOR) sylvain.beal@univ-fcomte.fr, Navarro-Ramos, Adriana2 (AUTHOR) adriana.navarro.ramos@univ-st-etienne.fr, Rémila, Eric2 (AUTHOR) eric.remila@univ-st-etienne.fr, Solal, Philippe2 (AUTHOR) solal@univ-st-etienne.fr |
| Source: |
Annals of Operations Research. Feb2025, Vol. 345 Issue 1, p59-103. 45p. |
| Subject Terms: |
*Hazardous wastes, *Cost shifting, *Transportation costs, Rules of games, Games |
| Abstract: |
We consider the cost sharing issue resulting from the maintenance of a hazardous waste transportation network represented by a sink tree. The participating agents are located on the nodes of the network and must transport their waste to the sink through costly network portions. We introduce the Liability rule, which is inspired by the principles applied by the courts to settle cost-allocation disputes in the context of hazardous waste. We provide an axiomatic characterization of this rule. Furthermore, we show that the Liability rule coincides with the Priority Shapley value, a new value on an appropriate domain of multi-choice games arising from hazardous waste transportation problems. Finally, we also axiomatize the Priority Shapley value on the full domain of multi-choice games. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
