A vector of balanced weights infers an inequality that games with a nonempty core obey.This paper gives a generalization of the notion `vector of balanced weights'.Herewith it provides necessary and sufficient conditions to determine whether a TU-game has a population monotonic allocation scheme...

This paper considers analogues of statements concerning compactness and finite coverings, in which the roles of spheres are replaced by cones. Furthermore, one of the finite covering results provides an application in Multi-Objective Programming; infinite sets of alternatives are reduced to...

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

In this paper standard oligopolies are interpreted in two ways, namely as oligopolies without transferable technologies and as oligopolies with transferable technologies.From a cooperative point of view this leads to two different classes of cooperative games.We show that cooperative oligopoly...

Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing...

In this paper we study information sharing situations.For every information sharing situation we construct an associated cooperative game, which we call an information sharing game.We show that the class of information sharing games co-incides with the class of cooperative games with a...

In this paper we model the formation of directed communication networks.A directed communication network is represented by a directed graph.Firstly, we study an allocation rule satisfying two appealing properties, component efficiency and directed fairness.We show that such an allocation rule...