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

The optimistic TU game in minimum cost spanning tree problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Gustavo Bergantiños ()
Juan Vidal-Puga ()

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://hdl.handle.net/10.1007/s00182-006-0069-7
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): 36 (2007)
Issue (Month): 2 (October)
Pages: 223-239
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:36:y:2007:i:2:p:223-239

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; Optimistic TU game; Shapley value;

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. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, 04. [Downloadable!] (restricted)
    Other versions:
  2. Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August. [Downloadable!] (restricted)
    Other versions:
  3. Ehud Kalai & Dov Samet, 1983. "On Weighted Shapley Values," Discussion Papers 602, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
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.)

  1. 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!]
  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. 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:
  4. 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)
  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!]
Statistics
Access and download statistics

Did you know? All the bibliographic data shown here has been contributed by volunteers, thereby helping to keep this service free.

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.