Results 171 to 180 of about 875,430 (205)
Some of the next articles are maybe not open access.
On the set of (perfect) equilibria of a bimatrix game
Naval Research Logistics, 1994Summary: 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, 2001Summary: 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 +3 more
openaire +2 more sources
Approximate Nash Equilibria in Bimatrix Games
2011Nash 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
Interval valued bimatrix games
Kybernetika, 2010This paper deals with a two-player simultaneous game with finite strategy sets. Instead of precise payoffs for the players, the upper and lower values of there payoffs are known. It is shown that the existence of an equilibrium for such an interval game is equivalent to the solvability of a certain linear integer system of equations and inequalities ...
openaire +2 more sources
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
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
Maximal nash subsets for bimatrix games
Naval Research Logistics Quarterly, 1981AbstractIn 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
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
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
Optimization approach to Berge equilibrium for bimatrix game
Optimization Letters, 2021Batbileg Sukhee, Enkhbat Rentsen
exaly
Extended matrix norm method: Applications to bimatrix games and convergence results
Applied Mathematics and Computation, 2023Murat Ozkaya +2 more
exaly