The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

Gustavo Bergantiños and Adriana Navarro

MPRA Paper from University Library of Munich, Germany

Abstract: We consider minimum cost spanning tree problems with multiple sources. We propose a cost allocation rule based on a painting procedure. Agents paint the edges on the paths connecting them to the sources. We prove that the painting rule coincides with the folk rule. Finally, we provide an axiomatic characterization.

Keywords: }minimum cost spanning tree problems with multiple sources; painting rule; axiomatic characterization. (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2019-01-25
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/91723/1/MPRA_paper_91723.pdf original version (application/pdf)
https://mpra.ub.uni-muenchen.de/94312/1/MPRA_paper_91723.pdf revised version (application/pdf)
https://mpra.ub.uni-muenchen.de/94312/4/MPRA_paper_94312.pdf revised version (application/pdf)

Related works:
Journal Article: The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources (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:pra:mprapa:91723

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().