Learning and mixed-strategy equilibria in evolutionary games
نویسندگان
چکیده
منابع مشابه
Learning and Mixed-Strategy Equilibria in Evolutionary Games
This paper considers whether Maynard Smith's concept of an evolutionarily stable strategy, or "ESS", can be used to predict long-run strategy frequencies in large populations whose members are randomly paired to play a game, and who adjust their strategies over time according to sensible learning rules. The existing results linking the ESS to stable equilibrium population strategy frequencies w...
متن کاملAn Evolutionary Interpretation of Mixed-strategy Equilibria*
One of the more convincing interpretations of mixed strategy equilibria describes a mixed equilibrium as a steady state in a large population in which all players use pure strategies but the population as a whole mimics a mixed strategy. To be complete, however, this interpretation requires a good story about how the population arrives at the appropriate distribution over pure strategies. In th...
متن کاملConstruction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games
This paper examines how to construct subgame-perfect mixed-strategy equilibria in discounted repeated games with perfect monitoring. We introduce a relatively simple class of strategy profiles that are easy to compute and may give rise to a large set of equilibrium payoffs. These sets are called self-supporting sets, since the set itself provides the continuation payoffs that are required to su...
متن کاملEvolutionary Stability of Pure-Strategy Equilibria in Finite Games
Sufficient conditions for pure-strategy Nash equilibria of finite games to be Ž . Lyapunov stable under a large class of evolutionary dynamics, the regular monotonic selection dynamics, are discussed. In particular, it is shown that in almost all finite extensive-form games, all the pure-strategy equilibria are stable. In such games, all mixed-strategy equilibria close to pure-strategy equilibr...
متن کاملComplexity and Mixed Strategy Equilibria∗
We propose a theory of mixed strategies in zero-sum two-person games. Given a finite zero-sum two-person game g, we extend it to collective games g∞ and g∞,S, which are infinite repetitions of the game g. Players in the collective games are restricted to use computable strategies only, but each has a complex sequence that can be used in the computation. We adopt kolmogorov complexity to define ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 1989
ISSN: 0022-5193
DOI: 10.1016/s0022-5193(89)80113-4