Additivity in minimum cost spanning tree problems
We characterize a rule in minimum cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity.
Year of publication: |
2009
|
---|---|
Authors: | Bergantiños, Gustavo ; Vidal-Puga, Juan |
Published in: |
Journal of Mathematical Economics. - Elsevier, ISSN 0304-4068. - Vol. 45.2009, 1-2, p. 38-42
|
Publisher: |
Elsevier |
Keywords: | Minimum cost spanning tree problems Additivity |
Saved in:
Saved in favorites
Similar items by person
-
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
Bergantiños, Gustavo, (2009)
-
Cooperative games for minimum cost spanning tree problems
Bergantiños, Gustavo, (2020)
-
Characterization of monotonic rules in minimum cost spanning tree problems
Bergantiños, Gustavo, (2012)
- More ...