A monotonic and merge-proof rule in minimum cost spanning tree situations

María Gómez-Rúa and Juan Vidal-Puga

Economic Theory, 2017, vol. 63, issue 3, No 8, 813-826

Abstract: Abstract We present a new model for cost sharing in minimum cost spanning tree problems to allow planners to identify how many agents merge. Under this new framework, in contrast to the traditional model, there are rules that satisfy the property of Merge-proofness. Furthermore, strengthening this property and adding some others, such as Population Monotonicity and Solidarity, makes it possible to define a unique rule that coincides with the weighted Shapley value of an associated cost game.

Keywords: Minimum cost spanning tree problems; Cost sharing; Core Selection; Cost Monotonicity; Merge-proofness; Weighted Shapley value (search for similar items in EconPapers)
JEL-codes: C71 D61 D63 D7 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://link.springer.com/10.1007/s00199-016-0996-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
Working Paper: A monotonic and merge-proof rule in minimum cost spanning tree situations (2015)
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:spr:joecth:v:63:y:2017:i:3:d:10.1007_s00199-016-0996-x

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

DOI: 10.1007/s00199-016-0996-x

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().