Advanced Search
MyIDEAS: Login to save this paper or follow this series

Characterization of monotonic rules in minimum cost spanning tree problems

Contents:

Author Info

  • Bergantiños, Gustavo
  • Vidal-Puga, Juan

Abstract

We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity over cost and population. We also prove that the set of allocations induced by the family coincides with the irreducible core.

Download Info

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.
File URL: http://mpra.ub.uni-muenchen.de/39994/
File Function: original version
Download Restriction: no

Bibliographic Info

Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 39994.

as in new window
Length:
Date of creation: Jul 2012
Date of revision:
Handle: RePEc:pra:mprapa:39994

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

Related research

Keywords: Cost sharing; minimum cost spanning tree problems; monotonicity; irreducible core;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, Elsevier, vol. 69(2), pages 224-237, July.
  2. Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties," Discussion Paper, Tilburg University, Center for Economic Research 2004-53, Tilburg University, Center for Economic Research.
  3. Norde, H.W. & Moretti, S. & Tijs, S.H., 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," Open Access publications from Tilburg University urn:nbn:nl:ui:12-123753, Tilburg University.
  4. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2004. "The P-value for cost sharing in minimum cost spanning tree situations," Open Access publications from Tilburg University urn:nbn:nl:ui:12-142598, Tilburg University.
  5. Bergantinos, Gustavo & Lorenzo-Freire, Silvia, 2008. ""Optimistic" weighted Shapley rules in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, Elsevier, vol. 185(1), pages 289-298, February.
  6. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, Elsevier, vol. 137(1), pages 326-352, November.
  7. Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "Additivity in minimum cost spanning tree problems," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 38-42, January.
  8. Gustavo Bergantiños & Silvia Lorenzo-Freire, 2008. "A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems," Economic Theory, Springer, Springer, vol. 35(3), pages 523-538, June.
  9. Leticia Lorenzo & Silvia Lorenzo-Freire, 2009. "A characterization of Kruskal sharing rules for minimum cost spanning tree problems," International Journal of Game Theory, Springer, Springer, vol. 38(1), pages 107-126, March.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:39994. 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: (Ekkehart Schlicht).

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.