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 p-value for cost sharing in minimum cost spanning tree situations

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Branzei, R.
Moretti, S.
Norde, H.W.
Tijs, S.H. (Tilburg University, Center for Economic Research)

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

Abstract

The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations. The P-value is related to the Kruskal algorithm for finding an mcst. Moreover, the P-value leads to a core allocation of the corresponding mcst game, and when applied also to the mcst subsituations it delivers a population monotonic allocation scheme. A conewise positive linearity property is one of the basic ingredients of an axiomatic characterization of the P-value.

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://arno.uvt.nl/show.cgi?fid=10486
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 129.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2003
Date of revision:
Handle: RePEc:dgr:kubcen:2003129

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:

This paper has been announced in the following NEP Reports: 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. Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February. [Downloadable!] (restricted)
  3. 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:
  4. 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!]
  5. Norde, H. & Moretti, S. & Tijs, S., 2001. "Minimum cost spanning tree games and population monotonic allocation schemes," Discussion Paper 18, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
  6. 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)
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. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Additivity in cost spanning tree problems," Game Theory and Information 0405001, EconWPA. [Downloadable!]
  2. 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:
  3. 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!]
    Other versions:
Statistics
Access and download statistics

Did you know? You too can volunteer for RePEc, for example by providing information about publications in your institution.

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.