Minimum cost spanning tree problems with indifferent agents

Christian Trudeau

Games and Economic Behavior, 2014, vol. 84, issue C, 137-151

Abstract: We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution (Kar, 2002) for classic mcst problems. It is obtained by adapting the Equal treatment property: if the cost of the edge between two agents changes, their cost shares are affected in the same manner if they have the same demand. If not, their changes are proportional to each other. We obtain a family of weighted Shapley values. Three interesting solutions in that family are characterized using stability, fairness and manipulation-proofness properties.

Keywords: Minimum cost spanning tree; Steiner tree; Cost sharing; Weighted Shapley value (search for similar items in EconPapers)
JEL-codes: C71 D63 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S089982561400013X
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Minimum cost spanning tree problems with indifferent agents (2013)
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:eee:gamebe:v:84:y:2014:i:c:p:137-151

DOI: 10.1016/j.geb.2014.01.010

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().