Displaying similar documents to “Solutions of transferable utility cooperative games”

An axiomatization of the aspiration core

Hans Keiding (2006)

Banach Center Publications

Similarity:

The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...

On the structure of the core of balanced games

Anton Stefanescu (2001)

Kybernetika

Similarity:

The uniform competitive solutions (u.c.s.) are basically stable sets of proposals involving several coalitions which are not necessarily disjoint. In the general framework of NTU games, the uniform competitive solutions have been defined in two earlier papers of the author (Stefanescu [5]) and Stefanescu [6]). The general existence results cover most situations formalized in the framework of the cooperative game theory, including those when the coalitional function is allowed to have...

Separability by semivalues modified for games with coalition structure

Rafael Amer, José Miguel Giménez (2009)

RAIRO - Operations Research

Similarity:

Two games are inseparable by semivalues if both games obtain the same allocation whatever semivalue is considered. The problem of separability by semivalues reduces to separability from the null game. For four or more players, the vector subspace of games inseparable from the null game by semivalues contains games different to zero-game. Now, for five or more players, the consideration of a priori coalition blocks in the player set allows us to reduce in a significant way the dimension...