A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976. The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for...

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...

We introduce the class of Obligation Rules for Minimum Cost Spanning Tree Situations. The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes. Another characteristic of Obligation Rules is that they assign to a minimum cost...

AMS classification: 90D05;

This study considers a simple newsvendor situation that consists of n retailers, all selling the same item with common purchasing costs and common selling prices.Groups of retailers might increase their expected joint profit by inventory centralization, which means that they make a joint order...