Thumbnail

The P-value for cost sharing in minimum cost spanning tree situations

Moretti, Stefano; Branzei, Rodica; Norde, Henk; Tijs, Stef (2005), The P-value for cost sharing in minimum cost spanning tree situations, Theory and Decision, 56, 1-2, p. 47-61. http://dx.doi.org/10.1007/s11238-004-5635-5

Voir/Ouvrir
Type
Article accepté pour publication ou publié
Date
2005
Nom de la revue
Theory and Decision
Volume
56
Numéro
1-2
Éditeur
Springer
Pages
47-61
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Moretti, Stefano cc
Branzei, Rodica
Norde, Henk
Tijs, Stef
Résumé (EN)
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations. The P-value is related to the Kruskal algorithm for finding an mcst. Moreover, the P-value leads to a core allocation of the corresponding mcst game, and when applied also to the mcst subsituations it delivers a population monotonic allocation scheme. A cone-wise positive linearity property is one of the basic ingredients of an axiomatic characterization of the P-value.
Mots-clés
Cost sharing; Minimum cost spanning tree games; Population monotonic allocation schemes; Value