A fair rule in minimum cost spanning tree problems

Gustavo Bergantiños and Juan Vidal-Puga

Game Theory and Information from University Library of Munich, Germany

Abstract: We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.

Keywords: minimum cost spanning tree; cost sharing (search for similar items in EconPapers)
JEL-codes: C7 D8 (search for similar items in EconPapers)
Pages: 35 pages
Date: 2005-04-04
New Economics Papers: this item is included in nep-gth
Note: Type of Document - pdf; pages: 35
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0504/0504001.pdf (application/pdf)

Related works:
Journal Article: A fair rule in minimum cost spanning tree problems (2007)
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:wpa:wuwpga:0504001

Access Statistics for this paper

More papers in Game Theory and Information from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA (volker.schallehn@ub.uni-muenchen.de this e-mail address is bad, please contact repec@repec.org).