The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations

R. Brânzei, S. Moretti, H.W. Norde, S.H. Tijs

Research output: Working paperDiscussion paperOther research output

336 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationTilburg
Number of pages16
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper


  • costs
  • games
  • allocation
  • population


Dive into the research topics of 'The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations'. Together they form a unique fingerprint.

Cite this