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.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
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.:
- 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.
- Moretti, S. & Norde, H.W. & Pham Do, K.H. & Tijs, S.H., 2001.
"Connection Problems in Mountains and Monotonic Allocation Schemes,"
2001-12, Tilburg University, Center for Economic Research.
- 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.
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.