Related papers: Anchored parallel repetition for nonlocal games

Normal-form two-player games are categorized by players into K analogy classes so as to minimize the prediction error about the behavior of the opponent. This results in Clustered Analogy-Based Expectation Equilibria in which strategies are…

This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical system (CPS) design. Formally, we consider a game graph G, a…

We consider a new class of repeated zero-sum games in which the payoff is the escape rate of a switched dynamical system, where at every stage, the transition is given by a nonexpansive operator depending on the actions of both players.…

We study synchronous values of games, especially synchronous games. It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy. However, we give examples of synchronous games, in…

Fictitious Play (FP) is a simple and natural dynamic for repeated play with many applications in game theory and multi-agent reinforcement learning. It was introduced by Brown (1949,1951) and its convergence properties for two-player…

If two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum…

A framework for discussing relationships between different types of games is proposed. Within the framework, quantum simultaneous games, finite quantum simultaneous games, quantum sequential games, and finite quantum sequential games are…

A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for perfect quantum hedging: a board game with winning probability…

We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…

We study the influence of Unruh effect on quantum non-zero sum games. In particular, we investigate the quantum Prisoners' Dilemma both for entangled and unentangled initial states and show that the acceleration of the noninertial frames…

We present a family of nonlocal games in which the inputs the players receive are continuous. We study three representative members of the family. For the first two a team sharing quantum correlations (entanglement) has an advantage over…

While many games were designed for steganography and robust watermarking, few focused on reversible watermarking. We present a two-encoder game related to the rate-distortion optimization of content-adaptive reversible watermarking. In the…

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…

We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric…

Many-body quantum games provide a natural perspective on phases of matter in quantum hardware, crisply relating the quantum correlations inherent in phases of matter to the securing of quantum advantage at a device-oriented task. In this…

We develop a method for the transfer of perfect strategies between various classes of two-player, one round cooperative non-local games with quantum inputs and outputs using the simulation paradigm in quantum information theory. We show…

Infinitely repeated games can support cooperative outcomes that are not equilibria in the one-shot game. The idea is to make sure that any gains from deviating will be offset by retaliation in future rounds. However, this model of…

We present a method of backward induction for computing approximate subgame perfect Nash equilibria of infinitely repeated games with discounted payoffs. This uses the selection monad transformer, combined with the searchable set monad…

We demonstrate that the largest gap between the entangled value and the classical value for a one-round two-player nonlocal game with a perfect entangled strategy using two Bell states of entanglement is at least $\frac{4}{35}$, improving…

We study deception in adversarial graph traversal, where a mobile agent seeks to reach a goal with minimum cost while an adversary alters edge costs to increase the total traversal cost. Unlike prior works that assume fixed…