Thumbnail

Minimum cost spanning tree games and population monotonic allocation schemes

Norde, Henk; Moretti, Stefano; Tijs, Stef (2004), Minimum cost spanning tree games and population monotonic allocation schemes, European Journal of Operational Research, 154, 1, p. 84-97. http://dx.doi.org/10.1016/S0377-2217(02)00714-2

Voir/Ouvrir
Type
Article accepté pour publication ou publié
Date
2004
Nom de la revue
European Journal of Operational Research
Volume
154
Numéro
1
Éditeur
Elsevier
Pages
84-97
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Norde, Henk
Moretti, Stefano cc
Tijs, Stef
Résumé (EN)
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme. As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0–1 cost functions. It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees. For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.
Mots-clés
Minimum cost spanning tree games; Population monotonic allocation schemes