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

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...

This paper introduces the class of 2 × 2 × 2 trimatrix games with identical anonymous best-replies. For this class a complete classification on the basis of the Nash equilibrium set is provided.

This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system, a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed...

This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. We analyze these situations by means of cooperative games with random payoffs. Special attention is paid to three types of convexity, namely coalitional-merge,...