Related papers: Quantal Response Equilibrium with a Continuum of T…
The quantum theory (QT) and new stochastic approaches have no deterministic prediction for a single measurement or for a single time -series of events observed for a trapped ion, electron or any other individual physical system. The…
In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…
Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…
The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…
Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work,…
A correlated equilibrium is a fundamental solution concept in game theory that enjoys many desirable properties. However, it requires a trusted mediator, which is a major drawback in many practical applications. A computational solution to…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…
A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash…
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…
Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…
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…
Recently, remarkable progress has been made by approximating Nash equilibrium (NE), correlated equilibrium (CE), and coarse correlated equilibrium (CCE) through function approximation that trains a neural network to predict equilibria from…
We study the global convergence of policy optimization for finding the Nash equilibria (NE) in zero-sum linear quadratic (LQ) games. To this end, we first investigate the landscape of LQ games, viewing it as a nonconvex-nonconcave…
We consider $N$-player games, in continuous time, finite state space and finite time horizon, on a geometrical structure possessing a macroscopic limit in a suitable sense. This geometrical structure breaks the permutation invariance…
We consider payoff-based learning of a generalized Nash equilibrium (GNE) in multi-agent systems. Our focus is on games with jointly convex constraints of a linear structure and strongly monotone pseudo-gradients. We present a convergent…
We consider simple stochastic games with terminal-node rewards and multiple players, who have differing perceptions of risk. Specifically, we study risk-sensitive equilibria (RSEs), where no player can improve their perceived reward --…
In this paper we consider continuity of the set of Nash equilibria and approximate Nash equilibria for parameterized games. For parameterized games with unique Nash equilibria, the continuity of this equilibrium mapping is well-known.…
While fictitious play is guaranteed to converge to Nash equilibrium in certain game classes, such as two-player zero-sum games, it is not guaranteed to converge in non-zero-sum and multiplayer games. We show that fictitious play in fact…
The term rational has become synonymous with maximizing expected payoff in the definition of the best response in Nash setting. In this work, we consider stochastic games in which players engage only once, or at most a limited number of…
S. J. van Enk and R. Pike in PRA 66, 024306 (2002) argue that the equilibrium solution to a quantum game isn't unique but is already present in the classical game itself. In this work, we contest this assertion by showing that a random…