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

A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This...

In this paper preparation sequencing situations are introduced. This new type of one-machine sequencing situations assumes that before a job can start, some preparation depending on its predecessor is required. Preparation sequencing situations are first analyzed from an operations research...

In this paper, we introduce a general framework for situations with decision making under uncertainty and cooperation possibilities. This framework is based upon a two stage stochastic programming approach. We show that under relatively mild assumptions the cooperative games associated with...

Many cooperative games, especially ones stemming from resource pooling in<br/>queuing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is...

A multi-choice game is a generalization of a cooperative game in which each player has several activity levels.This note provides several characterizations of the extended Shapley value as proposed by Derks and Peters (1993).Three characterizations are based on balanced contributions properties,...