Displaying similar documents to “Some values for constant-sum and bilateral 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...

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

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

Delegation equilibrium payoffs in integer-splitting games

Sylvain Sorin, Cheng Wan (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This work studies a new strategic game called delegation game. A delegation game is associated to a basic game with a finite number of players where each player has a finite integer weight and her strategy consists in dividing it into several integer parts and assigning each part to one subset of finitely many facilities. In the associated delegation game, a player divides her weight into several integer parts, commits each part to an independent delegate and collects the sum of their...

The Give and Take game: Analysis of a resource sharing game

Pedro Mariano, Luís Correia (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

We analyse Give and Take, a multi-stage resource sharing game to be played between two players. The payoff is dependent on the possession of an indivisible and durable resource, and in each stage players may either do nothing or, depending on their roles, give the resource or take it. Despite these simple rules, we show that this game has interesting complex dynamics. Unique to Give and Take is the existence of multiple Pareto optimal profiles that can also be Nash equilibria, and a...

Method of construction of the evasion strategy for differential games with many pursuers

Witold Rzymowski

Similarity:

CONTENTSIntroduction...........................................................................51. Preliminaries.....................................................................6 1.1. Notation........................................................................6 1.2. Control systems. Strategies..........................................72. Main lemma......................................................................93. Avoidance of many pursuers..........................................14 3.1....