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

On the Irreducible Core and the Equal Remaining Obligations Rule of Minimum Cost Spanning Extension Problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Feltkamp, V.
Tijs, S.
Muto, S. (Tilburg University, Center for Economic Research)

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

Abstract

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

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 file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://arno.uvt.nl/show.cgi?fid=3021
File Format: application/postscript
File Function:
Download Restriction: no
File URL: http://arno.uvt.nl/show.cgi?fid=3020
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 106.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 1994
Date of revision:
Handle: RePEc:dgr:kubcen:1994106

Contact details of provider:
Web page: http://center.uvt.nl

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

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. Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer, vol. 21(4), pages 339-50.
  2. Feltkamp, V. & Tijs, S. & Muto, S., 1994. "Minimum Cost Spanning Extension Problems : The Proportional Rule and the Decentralized Rule," Discussion Paper 96, Tilburg University, Center for Economic Research. [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. Juan J. Vidal-Puga & Gustavo Bergantiños, 2004. "Defining Rules in Cost Spanning Tree Problems Through the Canonical Form," Working Papers 2004.97, Fondazione Eni Enrico Mattei. [Downloadable!]
    Other versions:
  2. 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!]
  3. 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!]
  4. Lind, M. & Megen, F. van, 1996. "Order based cost allocation rules," Discussion Paper 56, Tilburg University, Center for Economic Research. [Downloadable!]
  5. 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!]
  6. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Additivity in cost spanning tree problems," Game Theory and Information 0405001, EconWPA. [Downloadable!]
  7. 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!]
  8. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Realizing efficient outcomes in cost spanning problems," Game Theory and Information 0403001, EconWPA. [Downloadable!]
  9. 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!]
  10. 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!]
  11. Tijs, S.H. & Branzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," Discussion Paper 53, Tilburg University, Center for Economic Research. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS also indexes book chapters.

This page was last updated on 2008-8-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.