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! ]

A characterization of Kruskal sharing rules for minimum cost spanning tree problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Leticia Lorenzo ()
Silvia Lorenzo-Freire ()
Abstract

No abstract is available for this item.

Download Info
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.

File URL: http://hdl.handle.net/10.1007/s00182-008-0147-0
File Format: text/html
File Function:
Download Restriction: Access to full text is restricted to subscribers.

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.

Publisher Info
Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 38 (2009)
Issue (Month): 1 (March)
Pages: 107-126
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:spr:jogath:v:38:y:2009:i:1:p:107-126

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).

Related research
Keywords: Minimum cost spanning tree problems; Kruskal’s algorithm; Sharing rules;

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.:
  1. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November. [Downloadable!] (restricted)
    Other versions:
  2. 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)
    Other versions:
  3. Feltkamp, V. & Tijs, S. & Muto, S., 1994. "On the Irreducible Core and the Equal Remaining Obligations Rule of Minimum Cost Spanning Extension Problems," Discussion Paper 106, Tilburg University, Center for Economic Research. [Downloadable!]
  4. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April. [Downloadable!] (restricted)
    Other versions:
  5. Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 36(2), pages 223-239, October. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? All bibliographic data on IDEAS has been put in the public domain by the publishers.

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.