Cost additive rules in minimum cost spanning tree problems with multiple sources

Gustavo Bergantiños and Leticia Lorenzo

MPRA Paper from University Library of Munich, Germany

Abstract: In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple sources called Kruskal sharing rules. This family is characterized with cone wise additivity and independence of irrelevant trees . We also investigate some subsets of this family and provide their axiomatic characterizations. The first subset is obtained by adding core selection. The second one is obtained by adding core selection and equal treatment of source costs

Keywords: minimum cost spanning tree problems; multiple sources; Kruskal sharing rules; axiomatic characterizations. (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2019-11-11
New Economics Papers: this item is included in nep-gth and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/96937/1/MPRA_paper_96937.pdf original version (application/pdf)

Related works:
Journal Article: Cost additive rules in minimum cost spanning tree problems with multiple sources (2021)
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:96937

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 ().