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 a three player dynamic public goods experiment, social output today determines production possibilities tomorrow.In each period, players choose to sabotage, to co-operate, or to play best response.Sabotage harms social output and growth.Mutual co-operation maximises both.The property rights...

In an experimental study we examine a variant of the 'minimum effort game', a coordination game with Pareto ranked equilibria, and risk considerations pointing to the least efficient equilibrium.We focus on the question whether simple cues such as smiles, winks and handshakes could be recognized...

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

Abstract: Lindelauf et al. (2009a) introduced a quantitative approach to investigate optimal structures of covert networks. This approach used an objective function which is based on the secrecy versus information trade-off these organizations face. Sageman (2008) hypothesized that covert...