This file is part of IDEAS , which uses RePEc data
[ Papers |
Articles |
Software |
Books |
Chapters |
Authors |
Institutions |
JEL Classification |
NEP reports |
Search |
New papers by email |
Author registration |
Rankings |
Volunteers |
FAQ |
Blog |
Help! ]
Minimum cost spanning tree games and population monotonic allocation schemes Author info | Abstract | Publisher info | Download info | Related research | Statistics Norde, H.
Moretti, S.
Tijs, S. (Tilburg University, Center for Economic Research)
Additional information is available for the following
registered author(s):
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
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
18.
Download reference. The following formats are available: HTML
(with abstract ),
plain text
(with abstract ),
BibTeX ,
RIS (EndNote, RefMan, ProCite),
ReDIF
Length:
Date of creation: 2001Date of revision:
Handle: RePEc:dgr:kubcen:200118Contact details of provider: Web page: http://center.uvt.nl
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Keywords: Other versions of this item:
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.
[Downloadable!] (restricted)
Moretti, S. & Norde, H. & Pham Do, K.H., 2001.
"Connection problems in mountains and monotonic allocation schemes ,"
Discussion Paper
12, Tilburg University, Center for Economic Research.
[Downloadable!]
Other versions:
Full
references Cited by : (explanations , 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.)
Ciftci, B.B. & Tijs, S.H., 2007.
"A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems ,"
Discussion Paper
2007-89, Tilburg University, Center for Economic Research.
[Downloadable!]
Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001.
"Operations research games: A survey ,"
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research ,
Springer, vol. 9(2), pages 139-199, December.
[Downloadable!] (restricted)
Other versions: Branzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003.
"The p-value for cost sharing in minimum cost spanning tree situations ,"
Discussion Paper
129, Tilburg University, Center for Economic Research.
[Downloadable!]
Gomez-Rua, Maria & Vidal-Puga, Juan, 2006.
"No advantageous merging in minimum cost spanning tree problems ,"
MPRA Paper
601, University Library of Munich, Germany.
[Downloadable!]
Dutta, Bhaskar & Mishra, Debasis, 2009.
"Minimum Cost Arborescences ,"
The Warwick Economics Research Paper Series (TWERPS)
889, University of Warwick, Department of Economics.
[Downloadable!]
Other versions: 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, vol. 10(1), pages 83-99, June.
[Downloadable!] (restricted)
Other versions: Gustavo Bergantiños & Juan Vidal-Puga, 2004.
"Additivity in cost spanning tree problems ,"
Game Theory and Information
0405001, EconWPA.
[Downloadable!]
Leticia Lorenzo & Silvia Lorenzo-Freire, 2009.
"A characterization of Kruskal sharing rules for minimum cost spanning tree problems ,"
International Journal of Game Theory ,
Springer, vol. 38(1), pages 107-126, March.
[Downloadable!] (restricted)
Tijs, Stef & Moretti, Stefano & Branzei, Rodica & Norde, Henk, 2005.
"The Bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects ,"
Discussion Paper
3, Tilburg University, Center for Economic Research.
[Downloadable!]
Tijs, S.H. & Branzei, R. & Moretti, S. & Norde, H.W., 2004.
"Obligation rules for minimum cost spanning tree situations and their monotonicity properties ,"
Discussion Paper
53, Tilburg University, Center for Economic Research.
[Downloadable!]
Other versions:
Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006.
"Obligation rules for minimum cost spanning tree situations and their monotonicity properties ,"
European Journal of Operational Research ,
Elsevier, vol. 175(1), pages 121-134, November.
[Downloadable!] (restricted) Jens Leth Hougaard & Hervé Moulin & Lars Peter Østerdal, 2008.
"Decentralized Pricing in Minimum Cost Spanning Trees ,"
Discussion Papers
08-24, University of Copenhagen. Department of Economics.
[Downloadable!]
Access and
download statistics Did you know? You can use IDEAS to provide links to papers and articles in your course syllabus.
This page was last updated on 2009-11-25.
This information is provided to you by IDEAS at the Department of Economics , College of Liberal Arts and Sciences , University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics .