Displaying similar documents to “On one algorithm finding all bimatrix game equilibria”

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

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.

On generalized games in H -spaces

Paolo Cubiotti, Giorgio Nordo (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We show that a recent existence result for the Nash equilibria of generalized games with strategy sets in H -spaces is false. We prove that it becomes true if we assume, in addition, that the feasible set of the game (the set of all feasible multistrategies) is closed.