Sharing a minimal cost spanning tree: Beyond the Folk solution
Several authors recently proposed an elegant construction to divide the minimal cost of connecting a given set of users to a source. This folk solution applies the Shapley value to the largest reduction of the cost matrix that does not affect the efficient cost. It is also obtained by the linear decomposition of the cost matrix in the canonical basis. Because it relies on the irreducible cost matrix, the folk solution ignores interpersonal differences in relevant connecting costs. We propose alternative solutions, some of them arbitrarily close to the folk solution, to resolve this difficulty.
Year of publication: |
2010
|
---|---|
Authors: | Bogomolnaia, Anna ; Moulin, Hervé |
Published in: |
Games and Economic Behavior. - Elsevier, ISSN 0899-8256. - Vol. 69.2010, 2, p. 238-248
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
On guarantees, vetoes and random dictators
Bogomolnaia, Anna, (2023)
-
A simple random assignment problem with a unique solution
Moulin, Hervé, (2001)
-
A new solution to the random assignment problem
Bogomolnaia, Anna, (2001)
- More ...