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 class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can...

The class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can...

We propose a simple model which embeds cost allocation games into a richer structure to take into account that information on costs can be itself costly. The model is an outgrowth of experience on cost allocation for consortia of municipalities dealing with garbage collection.

We propose a simple model which embeds cost allocation games into a richer structure to take into account that information on costs can be itself costly. The model is an outgrowth of experience on cost allocation for consortia of municipalities dealing with garbage collection. Copyright...