In this paper we study the endogenous formation of cooperation structures or communication graphs between players in a superadditive TU game. For each cooperation structure that is formed, the payoffs to the players are determined by an exogenously given solution. We model the process of...

This paper deals with a specific aspect of the problem of coalition formation in a situation described by a TU-game. First, we define a very simple normal form game which models the process of coalition formation. To define the payoff functions of the players we use an allocation rule for...

In this paper we consider a special class of n-person potential games and investigate partial cooperation between a portion of the players that sign a cooperative agreement. Existence results of partial cooperative equilibria are obtained and some possible applications are discussed,...

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

We introduce the aggregate-monotonic core as the set of allocations of a transferable utility cooperative game attainable by single-valued solutions that satisfy core-selection and aggregate-monotonicity. We provide a necessary and sufficient condition for the coincidence of the core and the...

Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization...

In this paper interval bankruptcy games arising from bankruptcy situations with interval claims are introduced. For this class of cooperative games two (marginal-based) Shapley-like values are considered and the relation between them is studied.

We extend the consistency principle for strategic games (Peleg and Tijs (1996)) to apply to solutions which assign to each game a collection of product sets of strategies. Such solutions turn out to satisfy desirable properties that solutions assigning to each game a collection of strategy...