相关论文: Evolutionary stability in quantum games

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…

We conducted a laboratory experiment involving human subjects to test the theoretical hypothesis that equilibrium selection can be impacted by manipulating the games dynamics process, by using modern control theory. Our findings indicate…

We introduce a simple stochastic dynamics for game theory. It assumes ``local'' rationality in the sense that any player climbs the gradient of his utility function in the presence of a stochastic force which represents deviation from…

The Letter presents a novel way to connect random walks, stochastic differential equations, and evolutionary game theory. We introduce a new concept of potential function for discrete-space stochastic systems. It is based on a…

Economists were content with the concept of the Nash equilibrium as game theory's solution concept until Daskalakis, Goldberg, and Papadimitriou showed that finding a Nash equilibrium is most likely a computationally hard problem, a result…

The introduction of concepts of Game Theory and Ordinary Differential Equations into Biology gave birth to the field of Evolutionary Stable Strategies, with applications in Biology, Genetics, Politics, Economics and others. In special, the…

We investigate the fluctuations induced by irrationality in simple games with a large number of competing players. We show that Nash equilibria in such games are ``weakly'' stable: irrationality propagates and amplifies through players'…

Algorithms for computing game-theoretic solutions have recently been applied to a number of security domains. However, many of the techniques developed for compact representations of security games do not extend to {\em Bayesian} security…

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…

A robust game is a distribution-free model to handle ambiguity generated by a bounded set of possible realizations of the values of players' payoff functions. The players are worst-case optimizers and a solution, called robust-optimization…

The predominant paradigm in evolutionary game theory and more generally online learning in games is based on a clear distinction between a population of dynamic agents that interact given a fixed, static game. In this paper, we move away…

The most popular stability notion in games should be Nash equilibrium under the rationality of players who maximize their own payoff individually. In contrast, in many scenarios, players can be (partly) irrational with some unpredictable…

We consider the existence and computational complexity of coalitional stability concepts based on social networks. Our concepts represent a natural and rich combinatorial generalization of a recent approach termed partition equilibrium. We…

We introduce a set-valued solution concept, M equilibrium, to capture empirical regularities from over half a century of game-theory experiments. We show M equilibrium serves as a meta theory for various models that hitherto were considered…

This paper introduces an equilibrium framework based on sequential sampling in which players face strategic uncertainty over their opponents' behavior and acquire informative signals to resolve it. Sequential sampling equilibrium delivers a…

In this paper, we examine the robustness of Nash equilibria in continuous games, under both strategic and dynamic uncertainty. Starting with the former, we introduce the notion of a robust equilibrium as those equilibria that remain…

Evolutionary Strategies (ES) are a popular family of black-box zeroth-order optimization algorithms which rely on search distributions to efficiently optimize a large variety of objective functions. This paper investigates the potential…

Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…

One could observe drastically different dynamics of zero-sum and non-zero-sum games under replicator equations. In zero-sum games, heteroclinic cycles naturally occur whenever the species of the population supersede each other in a cyclic…

Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and distributed average tracking dynamics, and is…