Displaying similar documents to “On the core of an incomplete n -person game”

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

Analysis and improvement attempt of prof. Alan Fowler's negotiation game

Jakub Jan Golik (2018)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...