English
Related papers

Related papers: Permissible four-strategy quantum extensions of cl…

200 papers

Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games…

Computer Science and Game Theory · Computer Science 2014-01-24 Romain Brenguier , Jean-François Raskin , Mathieu Sassolas

Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…

Physics and Society · Physics 2016-04-20 Gyorgy Szabo , Istvan Borsos

Truth, consistency and elementary equivalence can all be characterised in terms of games, namely the so-called evaluation game, the model-existence game, and the Ehrenfeucht-Fraisse game. We point out the great affinity of these games to…

Logic · Mathematics 2023-03-23 Jouko Väänänen

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

We present a game semantics for intuitionistic type theory. Specifically, we propose categories with families of a new variant of games and strategies for both extensional and intensional variants of the type theory with dependent function,…

Logic in Computer Science · Computer Science 2016-10-05 Norihiro Yamada

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

Quantum Physics · Physics 2009-09-03 Gus Gutoski

Extensive games are tools largely used in economics to describe decision processes ofa community of agents. In this paper we propose a formal presentation based on theproof assistant COQ which focuses mostly on infinite extensive games and…

Computer Science and Game Theory · Computer Science 2017-12-07 Pierre Lescanne

Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…

Computer Science and Game Theory · Computer Science 2015-07-29 Dietmar Berwanger , Anup Basil Mathew

Quantum phenomena have remained largely inaccessible to the general public. This can be attributed to the fact that we do not experience quantum mechanics on a tangible level in our daily lives. Games can provide an environment in which…

Quantum Physics · Physics 2019-07-12 Christopher Cantwell

We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…

Quantum Physics · Physics 2009-11-13 Alejandro Romanelli

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…

Quantum Physics · Physics 2007-05-23 Chiu Fan Lee , Neil F. Johnson

Game theory provides a framework for studying communication dynamics and emergent phenomena arising from rational agent interactions. We present a model framework for the Volunteer's Dilemma with four key contributions: (1) formulating it…

Multiagent Systems · Computer Science 2025-09-24 Jacob Dineen , A S M Ahsan-Ul Haque , Matthew Bielskas

In a previous paper a formalism to analyze the dynamical evolution of classical and quantum probability distributions in terms of their moments was presented. Here the application of this formalism to the system of a particle moving on a…

Quantum Physics · Physics 2014-12-19 David Brizuela

In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum…

Quantum Physics · Physics 2015-05-19 J. N. Leaw , S. A. Cheong

In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation…

Computer Science and Game Theory · Computer Science 2010-06-18 Soumya Paul , R. Ramanujam

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

Logic in Computer Science · Computer Science 2014-05-01 Dietmar Berwanger , Anup Basil Mathew

Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…

Computer Science and Game Theory · Computer Science 2020-02-04 Stéphane Le Roux

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…

Quantum Physics · Physics 2023-12-12 Kazuki Ikeda , Shoto Aoki

In this paper, we explore the susceptibility of the independent Q-learning algorithms (a classical and widely used multi-agent reinforcement learning method) to strategic manipulation of sophisticated opponents in normal-form games played…

Computer Science and Game Theory · Computer Science 2024-07-17 Yuksel Arslantas , Ege Yuceel , Muhammed O. Sayin

We study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of…

Probability · Mathematics 2018-07-27 Yakov Babichenko , Omer Tamuz