The function that assigns to each matrix game (i.e., the mixed extension of a finite zero-sum two-player game) its value is axiomatized by a number of intuitive properties.

In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as...

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

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

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

Different axiomatic systems for the Shapley value can be found in the literature.For games with a coalition structure, the Shapley value also has been axiomatized in several ways.In this paper, we discuss a generalization of the Shapley value to the class of partition function form games.The...

In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is...

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