An egalitarian approach for sharing the cost of a spanning tree

José-Manuel Giménez-Gómez, Josep E. Peris and Begoña Subiza

PLOS ONE, 2020, vol. 15, issue 7, 1-14

Abstract: A minimum cost spanning tree problem analyzes the way to efficiently connect individuals to a source. Hence the question is how to fairly allocate the total cost among these agents. Our approach, reinterpreting the spanning tree cost allocation as a claims problem defines a simple way to allocate the optimal cost with two main criteria: (1) each individual only pays attention to a few connection costs (the total cost of the optimal network and the cost of connecting himself to the source); and (2) an egalitarian criteria is used to share costs. Then, using claims rules, we define an egalitarian solution so that the total cost is allocated as equally as possible. We show that this solutions could propose allocations outside the core, a counter-intuitive fact whenever cooperation is necessary. Then we propose a modification to get a core selection, obtaining in this case an alternative interpretation of the Folk solution.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0236058 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 36058&type=printable (application/pdf)

Related works:
Working Paper: An Egalitarian Approach for Sharing the Cost of a Spanning Tree (2019)
Working Paper: An egalitarian approach for sharing the cost of a spanning tree (2019)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0236058

DOI: 10.1371/journal.pone.0236058

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone (plosone@plos.org).