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

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Tijs, Stef
Branzei, Rodica
Moretti, Stefano
Norde, Henk

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/B6VCT-4GNKRH8-8/2/11953b8761df30adfa54c5464aca77f9
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 European Journal of Operational Research.

Volume (Year): 175 (2006)
Issue (Month): 1 (November)
Pages: 121-134
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:ejores:v:175:y:2006:i:1:p:121-134

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

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

Related research
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.:
  1. 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:
  2. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Additivity in cost spanning tree problems," Game Theory and Information 0405001, EconWPA. [Downloadable!]
  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. 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!]
  5. 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)
  6. 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:
  7. 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:
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. 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. Moretti, Stefano & Tijs, Stef & Branzei, Rodica & ...,, 2005. "Cost monotonic 'Construct and Charge' rules for connection situations," Discussion Paper 104, Tilburg University, Center for Economic Research. [Downloadable!]
  3. 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!]
  4. 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!]
  5. 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)
  6. 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!]
Statistics
Access and download statistics

Did you know? About 1000 journals are listed on RePEc.

This page was last updated on 2009-12-3.

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.