Results 161 to 170 of about 757 (200)

On Random Symmetric Bimatrix Games

International Game Theory Review, 2020
An experiment was conducted on a sample of [Formula: see text] randomly generated symmetric bimatrix games with size [Formula: see text] and [Formula: see text]. Distribution of support sizes and Nash equilibria are used to formulate a conjecture: for finding a symmetric NEP it is enough to check supports up to size [Formula: see text] whereas for ...
Jozsef Abaffy, Ferenc Forgó
openaire   +2 more sources

Hard-to-Solve Bimatrix Games [PDF]

Econometrica, 2006
The Lemke-Howson algorithm is the classical method for finding one Nash equilibrium of a bimatrix game. This paper presents a class of square bimatrix games for which this algorithm takes, even in the best case, an exponential number of steps in the ...
Rahul Savani, Bernhard Von Stengel
exaly   +2 more sources

Equilibrium Points of Bimatrix Games

Journal of the Society for Industrial and Applied Mathematics, 1964
An algebraic proof is given of the existence of equilibrium points for bimatrix (or two-person, non-zero-sum) games. The proof is constructive, leading to an efficient scheme for computing an equilibrium point. In a nondegenerate case, the number of equilibrium points is finite and odd. The proof is valid for any ordered field.
Lemke, C. E., Howson, J. T. jun.
openaire   +4 more sources

Incompetence and impact of training in bimatrix games

Automatica, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Justin D. Beck, Vladimir Ejov, Jerzy A. Filar   +2 more
openaire   +4 more sources

On nash subsets of bimatrix games

Naval Research Logistics Quarterly, 1974
AbstractThis work considers a class of bimatrix games to which some well‐known structure theorems of 0‐sum matrix games can be made to generalize. It is additionally shown how to construct such games and how to generate the equilibrium points defining a given game as a member of that class.
openaire   +2 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

Uncertain bimatrix game with applications

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

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

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   +1 more source

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