English
Related papers

Related papers: Statistical physics approaches to Unique Games

200 papers

A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…

Quantum Physics · Physics 2013-11-05 Zhengfeng Ji

We provide game-theoretic proofs of some well-known existence theorems of Friedberg numberings for the class of all partial computable functions, including (1) the existence of two incomparable Friedberg numberings; (2) the existence of a…

Logic · Mathematics 2020-03-23 Takuma Imamura

We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…

Computer Science and Game Theory · Computer Science 2026-01-13 Sarvin Bahmani , Rasmus Ibsen-Jensen , Soumyajit Paul , Sven Schewe , Friedrich Slivovsky , Qiyi Tang , Dominik Wojtczak , Shufang Zhu

We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…

Quantum Physics · Physics 2012-07-23 Oded Regev , Thomas Vidick

This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two…

Computational Complexity · Computer Science 2020-02-06 Soumik Ghosh , John Watrous

One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been…

An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a $(1 - f(\epsilon))$-fraction of the constraints on any $(1-\epsilon)$-satisfiable instance, where the loss function…

Data Structures and Algorithms · Computer Science 2022-11-09 Antoine Méot , Arnaud de Mesmay , Moritz Mühlenthaler , Alantha Newman

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the…

Quantum Physics · Physics 2013-10-04 Marco Tomamichel , Serge Fehr , Jędrzej Kaniewski , Stephanie Wehner

In quantum game theory, one of the most intriguing and important questions is, "Is it possible to get quantum advantages without any modification of the classical game?" The answer to this question so far has largely been negative. So far,…

Quantum Physics · Physics 2016-02-16 Jeongho Bang , Junghee Ryu , Marcin Pawłowski , B. S. Ham , Jinhyoung Lee

We consider strong law of large numbers (SLLN) in the framework of game-theoretic probability of Shafer and Vovk (2001). We prove several versions of SLLN for the case that Reality's moves are unbounded. Our game-theoretic versions of SLLN…

Probability · Mathematics 2007-08-27 Masayuki Kumon , Akimichi Takemura , Kei Takeuchi

We develop a data-driven approach to the computation of a-posteriori feasibility certificates to the solution sets of variational inequalities affected by uncertainty. Specifically, we focus on instances of variational inequalities with a…

Optimization and Control · Mathematics 2022-02-17 Filippo Fabiani , Kostas Margellos , Paul J. Goulart

We give tolerant testers with sublinear query complexity in the adjacency-list model for Unique Games. Prior tolerant testers required structural assumptions such as expansion or clusterability. For Unique Games, the tester distinguishes…

Data Structures and Algorithms · Computer Science 2026-05-19 Yuichi Yoshida

The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum…

Computer Science and Game Theory · Computer Science 2017-01-23 Piotr Frackiewicz

This paper investigates stochastic generalized dynamic games with coupling chance constraints, where agents have incomplete information about uncertainties satisfying a concentration of measure property. This problem, in general, is…

Systems and Control · Electrical Eng. & Systems 2026-02-06 Seyed Shahram Yadollahi , Hamed Kebriaei , Sadegh Soudjani

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…

Logic in Computer Science · Computer Science 2018-05-01 Stephane Le Roux

There are only limited classes of multi-player stochastic games in which independent learning is guaranteed to converge to a Nash equilibrium. Markov potential games are a key example of such classes. Prior work has outlined sets of…

Computer Science and Game Theory · Computer Science 2024-05-15 Fatemeh Fardno , Seyed Majid Zahedi

A nonlocality anomaly in which a partially entangled state can outperform a maximally entangled state in a task exploiting nonlocality and several ways to remove the anomaly are discussed. A necessary condition for the anomaly to occur is…

Quantum Physics · Physics 2024-02-14 Yiruo Lin

We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…

Computer Science and Game Theory · Computer Science 2014-07-28 Piotr Frackiewicz

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…

Number Theory · Mathematics 2024-12-11 Dzmitry Badziahin , Stephen Harrap , Erez Nesharim , David Simmons

Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…

Optimization and Control · Mathematics 2019-09-11 Vassili Kolokoltsov