Minimum cost spanning tree games and population monotonic allocation schemes
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.
(This abstract was borrowed from another version of this item.)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs, 2002.
"Connection problems in mountains and monotonic allocation schemes,"
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research,
Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 83-99, June.
- Moretti, S. & Norde, H.W. & Pham Do, K.H. & Tijs, S.H., 2001. "Connection Problems in Mountains and Monotonic Allocation Schemes," Discussion Paper 2001-12, Tilburg University, Center for Economic Research.
- Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:154:y:2004:i:1:p:84-97. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.