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 fair rule in minimum cost spanning tree problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Bergantinos, Gustavo
Vidal-Puga, Juan J.

Additional information is available for the following registered author(s):

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://www.sciencedirect.com/science/article/B6WJ3-4N1SPDV-1/2/08e2f31083fa22eec3688ea96948d84c
File Format:
File Function:
Download Restriction: Full text for ScienceDirect subscribers only

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 Elsevier in its journal Journal of Economic Theory.

Volume (Year): 137 (2007)
Issue (Month): 1 (November)
Pages: 326-352
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:jetheo:v:137:y:2007:i:1:p:326-352

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869

For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).

Related research
Keywords:

Other versions of this item:

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.)
  1. Moretti, S. & Alparslan-Gok, S.Z. & Brânzei, R. & Tijs, S.H., 2008. "Connection Situations under Uncertainty," Discussion Paper 2008-64, Tilburg University, Center for Economic Research. [Downloadable!]
  2. 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!]
  3. 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)
  4. Gustavo Bergantiños & Juan Vidal-Puga, 2005. "On the Shapley value of a minimum cost spanning tree problem," Game Theory and Information 0509001, EconWPA. [Downloadable!]
  5. Gustavo Bergantinos & Juan Vidal-Puga, 2008. "On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems," AUCO Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 2(3), pages 251-267, December. [Downloadable!]
  6. 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!]
Statistics
Access and download statistics

Did you know? You too can volunteer for RePEc, for example by editing a NEP report.

This page was last updated on 2009-11-7.

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.