English
Related papers

Related papers: Testing the Quantal Response Hypothesis

200 papers

Nash equilibrium (NE) is a central concept in game theory. Here we prove formally a published theorem on existence of an NE in two proof assistants, Coq and Isabelle: starting from a game with finitely many outcomes, one may derive a game…

Computer Science and Game Theory · Computer Science 2017-09-08 Stéphane Le Roux , Érik Martin-Dorel , Jan-Georg Smaus

Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-11-16 Ziqin Chen , Ji Ma , Shu Liang , Li Li

In this article, we study a nonlocal game with two questions and three answers per player, which was first considered by Feige in 1991, and show that there is quantum advantage in this game. We prove that the game is a robust self-test for…

Quantum Physics · Physics 2026-02-27 Simon Schmidt , Sigurd A. L. Storgaard , Michael Walter , Yuming Zhao

This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that…

Computational Complexity · Computer Science 2013-10-16 Gus Gutoski , John Watrous

We show that in any $n$-player $m$-action normal-form game, we can obtain an approximate equilibrium by sampling any mixed-action equilibrium a small number of times. We study three types of equilibria: Nash, correlated and coarse…

Computer Science and Game Theory · Computer Science 2014-10-21 Yakov Babichenko , Siddharth Barman , Ron Peretz

This paper examines the convergence of no-regret learning in Cournot games with continuous actions. Cournot games are the essential model for many socio-economic systems, where players compete by strategically setting their output quantity.…

Computer Science and Game Theory · Computer Science 2020-02-12 Yuanyuan Shi , Baosen Zhang

We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game.…

Quantum Physics · Physics 2015-03-17 Ahmad Nawaz , A. H. Toor

The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…

Quantum Physics · Physics 2007-05-23 Andrey Grib , Georges Parfionov

Quantum games with incomplete information can be studied within a Bayesian framework. We consider a version of prisoner's dilemma (PD) in this framework with three players and characterize the Nash equilibria. A variation of the standard PD…

Quantum Physics · Physics 2017-03-10 Neal Solmeyer , Ricky Dixon , Radhakrishnan Balu

Whilst network coordination games and network anti-coordination games have received a considerable amount of attention in the literature, network games with coexisting coordinating and anti-coordinating players are known to exhibit more…

Computer Science and Game Theory · Computer Science 2021-10-26 Laura Arditti , Giacomo Como , Fabio Fagnani , Martina Vanelli

Games with unawareness model strategic situations in which players' perceptions about the game are limited. They take into account the fact that the players may be unaware of some of the strategies available to them or their opponents as…

Computer Science and Game Theory · Computer Science 2018-08-15 Piotr Frackiewicz

Achieving convergence of multiple learning agents in general $N$-player games is imperative for the development of safe and reliable machine learning (ML) algorithms and their application to autonomous systems. Yet it is known that, outside…

Computer Science and Game Theory · Computer Science 2023-01-24 Aamal Abbas Hussain , Francesco Belardinelli , Georgios Piliouras

This paper investigates closed-loop Nash equilibria for discrete-time linear-quadratic (LQ) stochastic nonzero-sum difference games with random coefficients. Unlike existing works, we consider randomness in both state dynamics and cost…

Optimization and Control · Mathematics 2025-07-23 Qingxin Meng , Yiwei Wu

In this paper, we introduce several types of correspondences: weakly naturally quasiconvex, *-weakly naturally quasiconvex, weakly biconvex and correspondences with *--weakly convex graph and we prove some fixed point theorems for these…

Optimization and Control · Mathematics 2013-04-03 Monica Patriche

We study discounted infinitely repeated games in which players agree on a cooperative mixed action profile but, at each step, observe only the realized pure actions. This form of imperfect monitoring breaks classical trigger strategies,…

Applications · Statistics 2026-03-09 Aymeric Capitaine , Antoine Scheid , Etienne Boursier , Alain Durmus , Michael I. Jordan

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under…

Optimization and Control · Mathematics 2019-06-06 Paulin Jacquot , Cheng Wan

In this paper, we propose a novel class of Nash problems for Cognitive Radio (CR) networks composed of multiple primary users (PUs) and secondary users (SUs) wherein each SU (player) competes against the others to maximize his own…

Information Theory · Computer Science 2015-06-12 Jong-Shi Pang , Gesualdo Scutari

The existence of simple uncoupled no-regret learning dynamics that converge to correlated equilibria in normal-form games is a celebrated result in the theory of multi-agent systems. Specifically, it has been known for more than 20 years…

Computer Science and Game Theory · Computer Science 2021-05-28 Gabriele Farina , Andrea Celli , Alberto Marchesi , Nicola Gatti