Related papers: Generalized Quantization Scheme for Two-Person Non…
We present a proposal for optically implementing the quantum game of the two-player quantum prisoner's dilemma involving nonmaximally entangled states by using beam splitters, phase shifters, cross-Kerr medium, photon detector and the…
In this report, some properties of the set of Nash equilibria (NEs) of $2 \times 2$ zero-sum games are reviewed. In particular, the cardinality of the set of NEs is given in terms of the entries of the payoff matrix. Moreover, closed-form…
Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement…
This technical note compares two coding (quantization) schemes for random projections in the context of sub-linear time approximate near neighbor search. The first scheme is based on uniform quantization while the second scheme utilizes a…
This paper proposes a multiscale method for solving the numerical solution of mean field games which accelerates the convergence and addresses the problem of determining the initial guess. Starting from an approximate solution at the…
Unlike Poker where the action space $\mathcal{A}$ is discrete, differential games in the physical world often have continuous action spaces not amenable to discrete abstraction, rendering no-regret algorithms with…
We consider a general nonzero-sum impulse game with two players. The main mathematical contribution of the paper is a verification theorem which provides, under some regularity conditions, a suitable system of quasi-variational inequalities…
In this paper, we generalize to three players the well-known CHSH quantum game. To do so, we consider all possible 3 variables Boolean functions and search among them which ones correspond to a game scenario with a quantum advantage (for a…
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…
The physical world obeys the rules of quantum, as opposed to classical, physics. Since the playing of any particular game requires physical resources, the question arises as to how Game Theory itself would change if it were extended into…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The authors have recently proposed a quantum description of financial market in terms of quantum game…
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one…
In this paper, the notion of F-schemes, a "generalization" of schemes, is introduced to cover unitary noncommutative rings.
Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the accumulated weight while reaching a target. Weighted timed games are notoriously difficult and…
This paper provides an efficient computational scheme to handle general security games from an adversarial risk analysis perspective. Two cases in relation to single-stage and multi-stage simultaneous defend-attack games motivate our…
We modify the concept of quantum strategic game to make it useful for extensive form games. We prove that our modification allows to consider the normal representation of any finite extensive game using the fundamental concepts of quantum…
In dynamic games with shared constraints, Generalized Nash Equilibria (GNE) are often computed using the normalized solution concept, which assumes identical Lagrange multipliers for shared constraints across all players. While widely used,…
We present a multipartite nonlocal game in which each player must guess the input received by his neighbour. We show that quantum correlations do not perform better than classical ones at this game, for any prior distribution of the inputs.…
We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation $A=(a_1,\dots, a_n)$ of a multiset $M$ of $n$ reals that sum up to $0$, where each of the $n!$ permutation…
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…