From a special class of TU games with information cost, given by the problem of sharing the costs of facilities among users, we build a noncooperative game in which every player asks for the assessment of whom the users are. We analyze two models, "naming" game and majority decision game: the...

We will introduce the notation of the generalized reduced game to “unify” the representations for maximal subclasses of the classes of essential games (superadditive games and convex games) that are closed under reduction in the sense of Sobolev (1975), Hart and Mas-Colell (1989), and Moulin...

Определяется набор решений кооперативных игр с трансферабельными полезностями, промежуточных между пред k-и n-ядрами. Все эти решения обладают свойствами...

This discussion paper resulted in a publication in the 'Annals of Operations Research' (forthcoming).<P> We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted...</p>

We will find 3 maximal subclasses with respect to essential, superadditive and convex games, respectively such that a game is in one subclass, so are its reduced games.

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