Displaying similar documents to “Equilibria in constrained concave bimatrix games”

Some values for constant-sum and bilateral cooperative games

Andrzej Młodak (2007)

Applicationes Mathematicae

Similarity:

We prove new axiomatizations of the Shapley value and the Banzhaf value, defined on the class of nonnegative constant-sum games with nonzero worth of the grand coalition as well as on nonnegative bilateral games with nonzero worth of the grand coalition. A characteristic feature of the latter class of cooperative games is that for such a game any coalition and its complement in the set of all players have the same worth. The axiomatizations are then generalized to the entire class of...

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

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 two-point Nash equilibria in bimatrix games with convexity properties

Wojciech Połowczuk (2006)

Applicationes Mathematicae

Similarity:

This paper considers bimatrix games with matrices having concavity properties. The games described by such payoff matrices well approximate two-person non-zero-sum games on the unit square, with payoff functions F₁(x,y) concave in x for each y, and/or F₂(x,y) concave in y for each x. For these games it is shown that there are Nash equilibria in players' strategies with supports consisting of at most two points. Also a simple search procedure for such Nash equilibria is given. ...

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

A new geometric approach to bimatrix games.

Gloria Fiestras-Janeiro, Ignacio García Jurado (1991)

Qüestiió

Similarity:

In this paper we study some properties concerning the equilibrium point of a bimatrix game and describe a geometric method to obtain all the equilibria of a bimatrix game when one of the players has at most three pure strategies.

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

Simple equilibria in finite games with convexity properties

Tadeusz Radzik, Piotr Więcek (2015)

Applicationes Mathematicae

Similarity:

This review paper gives a characterization of non-coalitional zero-sum and non-zero-sum games with finite strategy spaces and payoff functions having some concavity or convexity properties. The characterization is given in terms of the existence of two-point Nash equilibria, that is, equilibria consisting of mixed strategies with spectra consisting of at most two pure strategies. The structure of such simple equilibria is discussed in various cases. In particular, many of the results...