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 considers a refinement of equilibria for multicriteria games based on the perfectness concept of Selten (1975). Existence of perfect equilibrium points is shown and several characterizations are provided. Furthermore, contrary to the result for equilibria for multicriteria games, an...

How to compensate people who provide relevant information to a decision-maker who faces uncertainty?This paper suggests some compensation rules.These are studied both in a cooperative and a noncooperative environment.

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

Potential games and supermodular games are attractive games, especially because under certain conditions they possess pure Nash equilibria. Subclasses of games with a potential are considered which are also strategically equivalent to supermodular games. The focus is on two-person zero-sum games...

In this paper reasonable payoff intervals for players in a game in partition function form (p.f.f.game) are introduced and used to define the notion of compromisable p.f.f. game.For a compromisable p.f.f. game a compromise value is defined for which an axiomatic characterization is provided.Also...