Results 161 to 170 of about 561,032 (197)

Seeking the Equilibrium Situations in Bimatrix Games

Automation and Remote Control, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orlov, A. V., Strekalovskiĭ, A. S.
openaire   +1 more source

Uncertain bimatrix game with applications

Fuzzy Optimization and Decision Making, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Equilibrium Points in Bimatrix Games

Theory of Probability & Its Applications, 1958
An algorithm for computing all equilibrium points (situations) for the case of bimatrix (i.e., finite two-person, non-cooperative, non-zero-sum) games is given.
openaire   +2 more sources

On the set of (perfect) equilibria of a bimatrix game

Naval Research Logistics, 1994
Summary: This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player, Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope.
Jansen, M.J.M., Vermeulen, A.J.
openaire   +3 more sources

Enumeration of All Extreme Equilibria of Bimatrix Games

SIAM Journal on Scientific Computing, 2001
Summary: The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes (extreme equilibria) is sufficient to identify all equilibria. We present an algorithm that enumerates all extreme equilibria by exploiting complementary slackness optimality conditions of ...
Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard   +3 more
openaire   +2 more sources

Stochastic evolutionary dynamics of bimatrix games

Journal of Theoretical Biology, 2010
Evolutionary game dynamics of two-player asymmetric games in finite populations is studied. We consider two roles in the game, roles alpha and beta. alpha-players and beta-players interact and gain payoffs. The game is described by a pair of matrices, which is called bimatrix.
openaire   +2 more sources

Approximate Nash Equilibria in Bimatrix Games

2011
Nash equilibrium is one of the main concepts in the game theory. Recently it was shown, that problem of finding Nash equilibrium and an approximate Nash equilibrium is PPAD-complete. In this article we adapt Differential Evolution algorithm (DE) to the above problem.
Urszula Boryczka, Przemyslaw Juszczuk
openaire   +2 more sources

Maximal nash subsets for bimatrix games

Naval Research Logistics Quarterly, 1981
AbstractIn this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.
openaire   +1 more source

Game Theory ‘Bimatrix‘

2000
Das Funktionspaket GameTheory‘Bimatrix’ fast samtliche, im Text entwickelten Algorithmen zur Bestimmung bzw. Auswahl von spieltheoretischen Gleichgewichten zusammen. Es wird mit dem Befehl $$ < < GameTheory'Bimatrix' $$ in ein Mathematica- Notebook geladen.
openaire   +1 more source

Matrix and Bimatrix Games

1983
In this chapter, we study 2-person normal form games, zero-sum games (matrix games) as well as nonzero-sum games (bimatrix games). It is our objective to investigate whether, for the special case of a 2-person game, the results of the previous chapter can be refined and specialized.
openaire   +1 more source