Related papers: Results on the quantitative mu-calculus qMu
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 introduce a new unified framework for modelling both decision problems and finite games based on quantifiers and selection functions. We show that the canonical utility maximisation is one special case of a quantifier and that our more…
We consider the problem of two-player zero-sum games. This problem is formulated as a min-max Markov game in the literature. The solution of this game, which is the min-max payoff, starting from a given state is called the min-max value of…
We consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be…
An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the future values of the other variables. This restriction is…
Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum…
We give a tighter lifting theorem for security games in the quantum random oracle model. At the core of our main result lies a novel measure-and-reprogram framework that we call coherent reprogramming. This framework gives a tighter lifting…
We continue the analysis of quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory and quantum computing. The present paper is devoted to quantum bargaining games which are a…
We present a perspective on quantum games that focuses on the physical aspects of the quantities that are used to implement a game. If a game is to be played, it has to be played with objects and actions that have some physical existence.…
We define notions of cautiousness and cautious belief to provide epistemic conditions for iterated admissibility in finite games. We show that iterated admissibility characterizes the behavioral implications of "cautious rationality and…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
We consider the following model of decision-making by cognitive systems. We present an algorithm -- quantum-like representation algorithm (QLRA) -- which provides a possibility to represent probabilistic data of any origin by complex…
We analyze the necessary physical conditions to model an open quantum system as a quantum game. By applying the formalism of Quantum Operations on a particular system, we use Kraus operators as quantum strategies. The physical…
A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the…
We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It follows from this protocol that approximating the non-local value of a multi-player one-round game to…
This essay gives a self-contained introduction to quantum game theory, and is primarily oriented to economists with little or no acquaintance with quantum mechanics. It assumes little more than a basic knowledge of vector algebra. Quantum…