Related papers: Quantum two-players games, Entanglement and Nash e…

We study the evolutionary stability of Nash equilibria (NE) in a symmetric quantum game played by the recently proposed scheme of applying `identity' and `Pauli spin flip' operators on the initial state with classical probabilities. We show…

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…

We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer…

We propose a non-classical multi-player entangled state which eliminates the need for communication, yet can solve problems (that require coordination) better than classical approaches. For the entangled state, we propose a slater…

We prove communication complexity lower bounds for (possibly mixed) Nash equilibrium in potential games. In particular, we show that finding a Nash equilibrium requires $poly(N)$ communication in two-player $N \times N$ potential games, and…

It is common to assume that agents will adopt Nash equilibrium strategies; however, experimental studies have demonstrated that Nash equilibrium is often a poor description of human players' behavior in unrepeated normal-form games. In this…

We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players $n$. Our main result states that for $n$-player binary-action games and for constant $\varepsilon$, the query complexity of an…

We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement…

We prove that finding an epsilon-Nash equilibrium in a succinctly representable game with many players is PPAD-hard for constant epsilon. Our proof uses succinct games, i.e. games whose payoff function is represented by a circuit. Our…

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.

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…

We consider an algorithmic framework for two-player non-zero-sum semidefinite games, where each player's strategy is a positive semidefinite matrix with trace one. We formulate the computation of Nash equilibria in such games as…

We show that for any $\epsilon>0$, as the number of agents gets large, the share of games that admit a pure $\epsilon$-equilibrium converges to 1. Our result holds even for pure $\epsilon$-equilibrium in which all agents, except for at most…

We prove three results on the existence and structure of Nash equilibria for quasisupermodular games. A theorem is purely order-theoretic, and the other two involve topological hypotheses. Our topological results genralize Zhou's theorem…

Computing Nash equilibrium policies is a central problem in multi-agent reinforcement learning that has received extensive attention both in theory and in practice. However, provable guarantees have been thus far either limited to fully…

We show by counterexample that policy-gradient algorithms have no guarantees of even local convergence to Nash equilibria in continuous action and state space multi-agent settings. To do so, we analyze gradient-play in N-player general-sum…

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,…

We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…

On a filtered probability space $(\Omega ,\mathcal{F}, (\mathcal{F}_t)_{t\in[0,\infty]}, \mathbb{P})$, we consider the two-player non-zero-sum stopping game $u^i := \mathbb{E}[U^i(\rho,\tau)],\ i=1,2$, where the first player choose a…

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their…