For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is...

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

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

An assignment situation can be considered as a two-sided market consisting of two disjoint sets of objects. A non-negative reward matrix describes the profit if an object of one group is assigned to an object of the other group. Assuming that each object is owned by a different agent, Shapley...

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

We study the model of link formation that was introduced by Aumann and Myerson (1988) and focus on symmetric convex games with transferable utilities. We answer an open question in the literature by showing that in a specific symmetric convex game with six players a structure that results in the...

This study considers a supply chain that consists of n retailers, each of them facing a newsvendor problem, m warehouses and a supplier. The retailers are supplied with a single product via some warehouses. In these warehouses, the ordered amounts of goods of these retailers become available...

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

In this paper we study the relation between convexity of TU games and marginal vectors. We show that if specfic marginal vectors are core elements, then the game is convex. We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of...