Results 171 to 180 of about 595 (210)
Some of the next articles are maybe not open access.
Gradients for the evolution of bimatrix games
Journal of Mathematical Biology, 1987The evolutionary dynamics of bimatrix games is studied for rescaled partnership games and zero sum games. The former case leads to gradient systems. The selection equations for sexual and asexual reproduction of genotypes corresponding to mixed strategies are analysed. As examples, the origin of anisogamy and cyclic chases for predator-prey coevolution
Koth., M., Sigmund, K.
openaire +5 more sources
Incompetence and impact of training in bimatrix games
Automatica, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Justin D. Beck +2 more
openaire +4 more sources
On nash subsets of bimatrix games
Naval Research Logistics Quarterly, 1974AbstractThis 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, 1958An 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, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Seeking the Equilibrium Situations in Bimatrix Games
Automation and Remote Control, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orlov, A. V., Strekalovskiĭ, A. S.
openaire +1 more source
Mixed complementarity problems for robust optimization equilibrium in bimatrix game [PDF]
Applications of Mathematics, 2012 summary:In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent's strategies nor evaluate his own cost matrix accurately while he may estimate a bounded ...
Luo, Guimei
exaly +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 +1 more source
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
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