Related papers: Quantum Game Theory Based on the Schmidt Decomposi…
We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by…
Noncooperative game theory provides a normative framework for analyzing strategic interactions. However, for the toolbox to be operational, the solutions it defines will have to be computed. In this paper, we provide a single reduction that…
The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…
We introduce new theoretical insights into two-population asymmetric games allowing for an elegant symmetric decomposition into two single population symmetric games. Specifically, we show how an asymmetric bimatrix game (A,B) can be…
A simulation scheme of quantum version of Cournot's Duopoly is proposed, in which there is a new Nash equilibrium that may be also Pareto optimal without any entanglement involved. The unique property of this simulation scheme is…
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…
In bi-matrix games the Bishop-Cannings theorem of the classical evolutionary game theory does not permit pure evolutionarily stable strategies (ESSs) when a mixed ESS exists. We find the necessary form of two-qubit initial quantum states…
Computing the excited states of a given Hamiltonian is computationally hard for large systems, but methods that do so using quantum computers scale tractably. This problem is equivalent to the PCA problem where we are interested in…
Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…
This paper introduces two fundamentally new concepts to game theory: multilateral Nash equilibria and families of games. Starting with non-cooperative games, we show how these notions together seamlessly integrate into and naturally extend…
Several quantum versions of the battle of the sexes game are analyzed. Some of them are shown to reproduce the classical game. In some, there are no Nash quantum pure equilibria. In some others, the payoffs are always equal to each other.…
Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some…
We initiate the study of quantum races, games where two or more quantum computers compete to solve a computational problem. While the problem of dueling algorithms has been studied for classical deterministic algorithms, the quantum case…
Nash equilibria provide a principled framework for modeling interactions in multi-agent decision-making and control. However, many equilibrium-seeking methods implicitly assume that each agent has access to the other agents' objectives and…
The paper introduces a new approach to theory of differential games in which entangled players try to predict and influence actions of their adversaries. The entanglement is generated be a joint probability density known by the players.…
Network games provide a natural machinery to compactly represent strategic interactions among agents whose payoffs exhibit sparsity in their dependence on the actions of others. Besides encoding interaction sparsity, however, real networks…
Landsburg method of classifying mixed Nash equilibria for maximally entangled Eisert-Lewenstein-Wilkens (ELW) game is analyzed with special emphasis on symmetries inherent to the problem. Nash equilibria for the original ELW game are…
This paper provides theoretical bounds for empirical game theoretical analysis of complex multi-agent interactions. We provide insights in the empirical meta game showing that a Nash equilibrium of the meta-game is an approximate Nash…
The computational characterization of game-theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing computationally efficient tools for finding optimal ways to behave in strategic interactions.…
The paper is concerned with a zero-sum Stackelberg stochastic linear-quadratic (LQ, for short) differential game over finite horizons. Under a fairly weak condition, the Stackelberg equilibrium is explicitly obtained by first solving a…