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

Interval bankruptcy problems arise in situations where an estate has to be liquidated among a fixed number of creditors and uncertainty about the amounts of the estate and the claims is modeled by intervals. We extend in the interval setting the classic results by Curiel, Maschler and Tijs...

The lexicographic vectors of a balanced game, called here leximals, are used to define a new solution concept, the lexicore, on the cone of balanced games. Properties of the lexicore and its relation with the core on some classes of games are studied. It is shown that on cones of balanced games...

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

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

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 special class of conservative charge systems for minimum cost spanning tree (mcst) situations is introduced.These conservative charge systems lead to single-valued rules for mcst situations, which can also be described with the aid of obligation functions and are, consequently, cost...

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