Related papers: Evolutionarily Stable Strategies in Quantum Games
Effects of classical/quantum correlations and operations in game theory are analyzed using Samaritan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or…
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…
We propose a scheme for a quantum game based on performing an EPR type experiment and in which each player's spatial directional choices are considered as their strategies. A classical mixed-strategy game is recovered by restricting the…
Over the past few decades, many works have studied the evolutionary dynamics of continuous games. However, previous works have primarily focused on two-player games with pairwise interactions. Indeed, group interactions rather than pairwise…
We introduce an evolutionary game on hypergraphs in which decisions between a risky alternative and a safe one are taken in social groups of different sizes. The model naturally reproduces choice shifts, namely the differences between the…
We propose a game-theoretic dynamics of a population of replicating individuals. It consists of two parts: the standard replicator one and a migration between two different habitats. We consider symmetric two-player games with two…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…
The concept of evolutionarily stability and its relation with the fixed points of the replicator equation are important aspects of evolutionary game dynamics. In the light of the fact that oscillating state of a population and individuals…
A simplified prisoner's game is studied on a square lattice when the players interacting with their neighbors can follow only two strategies: to cooperate (C) or to defect (D) unconditionally. The players updated in a random sequence have a…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
Competition among cooperators, defectors, and loners is studied in an evolutionary prisoner's dilemma game with optional participation. Loners are risk averse i.e. unwilling to participate and rather rely on small but fixed earnings. This…
Nash equilibrium is used as a model to explain the observed behavior of players in strategic settings. For example, in many empirical applications we observe player behavior, and the problem is to determine if there exist payoffs for the…
Generative Adversarial Networks (GANs) learn an implicit generative model from data samples through a two-player game. In this paper, we study the existence of Nash equilibrium of the game which is consistent as the number of data samples…
We give an example of a finite-state two-player turn-based stochastic game with safety objectives for both players which has no stationary Nash equilibrium. This answers an open question of Secchi and Sudderth.
Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…
The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work, we introduce a…
Most of atoms and molecule found in nature are capable of evolving towards and staying at their ground states, the lowest energy states. This paper offers a global optimization approach to understand the ground state as the equilibrium…
Adversarial training is a standard technique for training adversarially robust models. In this paper, we study adversarial training as an alternating best-response strategy in a 2-player zero-sum game. We prove that even in a simple…
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we…
We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy…