Related papers: Computational Complexity of Multi-Player Evolution…
The concept of an evolutionarily stable strategy (ESS), introduced by Smith and Price, is a refinement of Nash equilibrium in 2-player symmetric games in order to explain counter-intuitive natural phenomena, whose existence is not…
While the computational complexity of many game-theoretic solution concepts, notably Nash equilibrium, has now been settled, the question of determining the exact complexity of computing an evolutionarily stable strategy has resisted…
We present an algorithm for computing evolutionarily stable strategies (ESSs) in symmetric perfect-recall extensive-form games of imperfect information. Our main algorithm is for two-player games, and we describe how it can be extended to…
Evolutionarily stable strategy (ESS) is an important solution concept in game theory which has been applied frequently to biological models. Informally an ESS is a strategy that if followed by the population cannot be taken over by a…
The study of evolutionary games with pairwise local interactions has been of interest to many different disciplines. Also local interactions with multiple opponents had been considered, although always for a fixed amount of players. In many…
Evolutionarily stable strategy (ESS) is the defining concept of evolutionary game theory. It has a fairly unanimously accepted definition for the case of symmetric games which are played in a homogeneous population where all individuals are…
An evolutionarily stable strategy (ESS) is an equilibrium strategy that is immune to invasions by rare alternative (``mutant'') strategies. Unlike Nash equilibria, ESS do not always exist in finite games. In this paper we address the…
Evolutionarily Stable Strategy (ESS) in classical game theory is a refinement of Nash equilibrium concept. We investigate the consequences when a small group of mutants using quantum strategies try to invade a classical ESS in a population…
It is well-known that the problem of recognizing an ESS in a symmetric bimatrix game is coNP-complete. In this paper, we show that recognizing an ESS even in doubly symmetric bimatrix games is also coNP-complete. Our result further implies…
Evolutionarily stable strategy (ESS) is a key concept in evolutionary game theory. ESS provides an evolutionary stability criterion for biological, social and economical behaviors. In this paper, we develop a new approach to evaluate ESS in…
In evolutionary game theory an Evolutionarily Stable Strategy (ESS) is a refinement of the Nash equilibrium concept that is sometimes also recognized as evolutionary stability. It is a game-theoretic model, well known to mathematical…
We quantized the Hawk-Dove game by using the most general form of a pure initial state to investigate the existence of pure and mixed Evolutionarily Stable Strategies (ESS). An example is considered to draw a comparison between classical…
An evolutionarily stable strategy (ESS) was originally defined as a static concept but later given a dynamic characterization. A well known theorem in evolutionary game theory says that an ESS is an attractor of replicator dynamics but not…
We present an algorithm for computing all evolutionarily stable strategies in nondegenerate normal-form games with three or more players.
We study the computational complexity of decision problems about Nash equilibria in $m$-player games. Several such problems have recently been shown to be computationally equivalent to the decision problem for the existential theory of the…
As an equilibrium refinement of the Nash equilibrium, evolutionarily stable strategy (ESS) is a key concept in evolutionary game theory and has attracted growing interest. An ESS can be either a pure strategy or a mixed strategy. Even…
The complexity of computing equilibrium refinements has been at the forefront of algorithmic game theory research, but it has remained open in the seminal class of potential games; we close this fundamental gap in this paper. We first show…
Animal behavior and evolution can often be described by game-theoretic models. Although in many situations, the number of players is very large, their strategic interactions are usually decomposed into a sum of two-player games. Only…
Adversarial multiplayer games are an important object of study in multiagent learning. In particular, polymatrix zero-sum games are a multiplayer setting where Nash equilibria are known to be efficiently computable. Towards understanding…
Evolutionary game theory is an abstract and simple, but very powerful way to model evolutionary dynamics. Even complex biological phenomena can sometimes be abstracted to simple two-player games. But often, the interaction between several…