On the Shapley value of a minimum cost spanning tree problem
Gustavo Bergantiños and
Game Theory and Information from University Library of Munich, Germany
We associate an optimistic coalitional game with each minimum cost spanning tree problem. We define the worth of a coalition as the cost of connection assuming that the rest of the agents are already connected. We define a cost sharing rule as the Shapley value of this optimistic game. We prove that this rule coincides with a rule present in the literature under different names. We also introduce a new characterization using a property of equal contributions.
Keywords: minimum; cost; spanning; tree; problems; Shapley; value (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth
Note: Type of Document - pdf; pages: 17
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:0509001
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 ().