Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2004.11217

Games in Minkowski Spacetime

Ghislain Fourny

Published Apr 23, 2020• 4 citations
arXivHTMLPDF

Abstract

This paper contributes a new class of games called spacetime games with perfect information. In spacetime games, the agents make decisions at various positions in Minkowski spacetime. Spacetime games can be seen as the least common denominator of strategic games on the one hand, and dynamic games with perfect information on the other hand. Indeed, strategic games correspond to a configuration with only spacelike-separated decisions ("different rooms"). Dynamic games with perfect information, on the other hand, correspond to timelike-separated decisions ("in turn"). We show how to compute the strategic form and reduced strategic form of spacetime games. As a consequence, many existing solution concepts, such as Nash equilibria, rationalizability, individual rationality, etc, apply naturally to spacetime games. We introduce a canonical injection of the class of spacetime games with perfect information into the class of games in extensive form with imperfect information; we provide a counterexample showing that this is a strict superset. This provides a novel interpretation of a large number of games in extensive form with imperfect information in terms of the theory of special relativity, where non-singleton information sets arise from the finite speed of light. This framework can be a useful tool for reasoning in quantum foundations, where it is important whether decisions such as the choice of a measurement axis or the outcome of a measurement are spacelike- or timelike- separated. We look in particular at the special case of the Einstein-Podolsky-Rosen experiment with four decision points, and model a corresponding spacetime game structure.

DOI
10.3929/ethz-b-000557584

Related papers

Contingent Free Choice: On Extending Quantum Theory to a Contextual, Deterministic Theory With Improved Predictive Power

Ghislain Fourny

The non-extensibility of quantum theory into a theory with improved predictive power is based on a strong assumption of independent free choice, in which the physicists pick a measurement axis independently of anything that couldn't have been caused by their decision. Independent free choice is also at the core of the Nash equilibrium and classical game theory. A more recent line of game-theoretical research based on weakening free choice leads to non-trivial solution concepts with desirable properties such as at-most uniqueness, Pareto optimality, and contextuality. We show how introducing contingent free choice in the foundations of quantum theory yields a class of deterministic and contextual theories with an improved predictive power, and contrast them with the pilot-wave theory. Specifically, we suggest that quantum experiments, such as the EPR experiment, involving measurements located in spacetime, can be recast as dynamic games with imperfect information involving human agents and the universe. The underlying idea is that a physicist picking a measurement axis and the universe picking a measurement outcome are two faces of the same physical contingency phenomenon. The classical, Nashian resolution of these games based on independent free choice is analogous to local hidden variable theories, constrained by the Bell inequalities. On the other hand, in a setup in which agents are rational and omniscient in all possible worlds, under contingent free choice, the Perfectly Transparent Equilibrium provides a contextual resolution, based on the iterated elimination of inconsistent worlds, towards an at-most unique possible world, in which the outcomes of measurements that actually are carried out, and only them, are deterministically defined.

arXiv:1907.01962•Jul 3, 2019•3 citations

Spacetime Games Subsume Causal Contextuality Scenarios

Ghislain Fourny

Abstract We show that a category of causal contextuality scenarios with no cycles, unique causal bridges, and causally secured covers is equivalent to a category containing a subclass of the formerly published spacetime games, which generalize game theory to decisions arbitrarily located in Minkowski spacetime. This insight can lead to certain constructs and proofs being shorter, simpler, and more intuitive when expressed in the spacetime game framework than in the causal contextuality scenario framework. We argue that the requirement to have unique causal bridges does not lead to a loss of generality in the physical systems that can be modelled. The equivalence of categories and the modular structure of causal contextuality theory also opens the way to later building pure strategy sheaves, mixed strategy presheaves, and empirical models on top of spacetime games: the obstruction to a global section in the presence of contextuality corresponds to the non-existence of a mixed strategy in the sense of the Nash game theory framework. This shows that the insights of both frameworks taken together can contribute positively to advancing the field of quantum foundations.

arXiv:2405.20143•International Journal of Theoretical Physics•Mar 17, 2026•2 citations

Quantum signaling game

Piotr Frąckiewicz

We present a quantum approach to a signaling game; a special kind of extensive game 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 some fixed initial state and the payoff function is given by a measurement on the resulting final state. We show that the quantum game induced by our scheme coincides with a signaling game as a special case and outputs nonclassical results in general. As an example, we consider a quantum extension of the signaling game in which the chance move is a three-parameter unitary operator whereas the players' actions are equivalent to classical ones. In this case, we study the game in terms of Nash equilibria and refine the pure Nash equilibria adapting to the quantum game the notion of a weak perfect Bayesian equilibrium.

arXiv:1407.6757•Journal of Physics A Mathematical and Theoretical•Jul 10, 2014•6 citations

Studies in the Theory of Quantum Games

Azhar Iqbal

Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum communication protocols, and algorithms, in terms of games between quantum and classical players. The possibility led to the view that quantum games have a potential to provide helpful insight into working of quantum algorithms, and even in finding new ones. This thesis analyzes and compares some interesting games when played classically and quantum mechanically. A large part of the thesis concerns investigations into a refinement notion of the Nash equilibrium concept. The refinement, called an evolutionarily stable strategy (ESS), was originally introduced in 1970s by mathematical biologists to model an evolving population using techniques borrowed from game theory. Analysis is developed around a situation when quantization changes ESSs without affecting corresponding Nash equilibria. Effects of quantization on solution-concepts other than Nash equilibrium are presented and discussed. For this purpose the notions of value of coalition, backwards-induction outcome, and subgame-perfect outcome are selected. Repeated games are known to have different information structure than one-shot games. Investigation is presented into a possible way where quantization changes the outcome of a repeated game. Lastly, two new suggestions are put forward to play quantum versions of classical matrix games. The first one uses the association of De Broglie's waves, with travelling material objects, as a resource for playing a quantum game. The second suggestion concerns an EPR type setting exploiting directly the correlations in Bell's inequalities to play a bi-matrix game.

arXiv:quant-ph/0503176•Mar 21, 2005•47 citations

The Game Theory in Quantum Computers: A Review.

Raquel Pérez Antón, José Ignacio López Sánchez, Alberto Corbí

Game theory has been studied extensively in recent centuries as a set of formal mathematical strategies for optimal decision making. This discipline improved its efficiency with the arrival, in the 20th century, of digital computer science. However, the computational limitations related to exponential time type problems in digital processors, triggered the search for more efficient alternatives. One of these choices is quantum computing. Certainly, quantum processors seem to be able to solve some of these complex problems, at least in theory. For this reason, in recent times, many research works have emerged related to the field of quantum game theory. In this paper we review the main studies about the subject, including operational requirements and implementation details. In addition, we describe various quantum games, their design strategy, and the used supporting tools. We also present the still open debate linked to the interpretation of the transformations of classical algorithms in fundamental game theory to their quantum version, with special attention to the Nash equilibrium.

International Journal of Interactive Multimedia and Artificial Intelligence•Oct 2, 2023•10 citations

Quantum game theory and the complexity of approximating quantum Nash equilibria

John Bostanci, John Watrous

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.

arXiv:2102.00512•Quantum•Dec 22, 2022•24 citations
This paper contributes a new class of games called spacetime games with perfect information. In spacetime games, the agents make decisions at various positions in Minkowski spacetime. Spacetime games can be seen as the least common denominator of strategic games on the one hand, and dynamic games with perfect information on the other hand. Indeed, strategic games correspond to a configuration with only spacelike-separated decisions ("different rooms"). Dynamic games with perfect information, on the other hand, correspond to timelike-separated decisions ("in turn"). We show how to compute the strategic form and reduced strategic form of spacetime games. As a consequence, many existing solution concepts, such as Nash equilibria, rationalizability, individual rationality, etc, apply naturally to spacetime games. We introduce a canonical injection of the class of spacetime games with perfect information into the class of games in extensive form with imperfect information; we provide a counterexample showing that this is a strict superset. This provides a novel interpretation of a large number of games in extensive form with imperfect information in terms of the theory of special relativity, where non-singleton information sets arise from the finite speed of light. This framework can be a useful tool for reasoning in quantum foundations, where it is important whether decisions such as the choice of a measurement axis or the outcome of a measurement are spacelike- or timelike- separated. We look in particular at the special case of the Einstein-Podolsky-Rosen experiment with four decision points, and model a corresponding spacetime game structure.
The non-extensibility of quantum theory into a theory with improved predictive power is based on a strong assumption of independent free choice, in which the physicists pick a measurement axis independently of anything that couldn't have been caused by their decision. Independent free choice is also at the core of the Nash equilibrium and classical game theory. A more recent line of game-theoretical research based on weakening free choice leads to non-trivial solution concepts with desirable properties such as at-most uniqueness, Pareto optimality, and contextuality. We show how introducing contingent free choice in the foundations of quantum theory yields a class of deterministic and contextual theories with an improved predictive power, and contrast them with the pilot-wave theory. Specifically, we suggest that quantum experiments, such as the EPR experiment, involving measurements located in spacetime, can be recast as dynamic games with imperfect information involving human agents and the universe. The underlying idea is that a physicist picking a measurement axis and the universe picking a measurement outcome are two faces of the same physical contingency phenomenon. The classical, Nashian resolution of these games based on independent free choice is analogous to local hidden variable theories, constrained by the Bell inequalities. On the other hand, in a setup in which agents are rational and omniscient in all possible worlds, under contingent free choice, the Perfectly Transparent Equilibrium provides a contextual resolution, based on the iterated elimination of inconsistent worlds, towards an at-most unique possible world, in which the outcomes of measurements that actually are carried out, and only them, are deterministically defined.
Abstract We show that a category of causal contextuality scenarios with no cycles, unique causal bridges, and causally secured covers is equivalent to a category containing a subclass of the formerly published spacetime games, which generalize game theory to decisions arbitrarily located in Minkowski spacetime. This insight can lead to certain constructs and proofs being shorter, simpler, and more intuitive when expressed in the spacetime game framework than in the causal contextuality scenario framework. We argue that the requirement to have unique causal bridges does not lead to a loss of generality in the physical systems that can be modelled. The equivalence of categories and the modular structure of causal contextuality theory also opens the way to later building pure strategy sheaves, mixed strategy presheaves, and empirical models on top of spacetime games: the obstruction to a global section in the presence of contextuality corresponds to the non-existence of a mixed strategy in the sense of the Nash game theory framework. This shows that the insights of both frameworks taken together can contribute positively to advancing the field of quantum foundations.
We present a quantum approach to a signaling game; a special kind of extensive game 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 some fixed initial state and the payoff function is given by a measurement on the resulting final state. We show that the quantum game induced by our scheme coincides with a signaling game as a special case and outputs nonclassical results in general. As an example, we consider a quantum extension of the signaling game in which the chance move is a three-parameter unitary operator whereas the players' actions are equivalent to classical ones. In this case, we study the game in terms of Nash equilibria and refine the pure Nash equilibria adapting to the quantum game the notion of a weak perfect Bayesian equilibrium.
Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum communication protocols, and algorithms, in terms of games between quantum and classical players. The possibility led to the view that quantum games have a potential to provide helpful insight into working of quantum algorithms, and even in finding new ones. This thesis analyzes and compares some interesting games when played classically and quantum mechanically. A large part of the thesis concerns investigations into a refinement notion of the Nash equilibrium concept. The refinement, called an evolutionarily stable strategy (ESS), was originally introduced in 1970s by mathematical biologists to model an evolving population using techniques borrowed from game theory. Analysis is developed around a situation when quantization changes ESSs without affecting corresponding Nash equilibria. Effects of quantization on solution-concepts other than Nash equilibrium are presented and discussed. For this purpose the notions of value of coalition, backwards-induction outcome, and subgame-perfect outcome are selected. Repeated games are known to have different information structure than one-shot games. Investigation is presented into a possible way where quantization changes the outcome of a repeated game. Lastly, two new suggestions are put forward to play quantum versions of classical matrix games. The first one uses the association of De Broglie's waves, with travelling material objects, as a resource for playing a quantum game. The second suggestion concerns an EPR type setting exploiting directly the correlations in Bell's inequalities to play a bi-matrix game.
Game theory has been studied extensively in recent centuries as a set of formal mathematical strategies for optimal decision making. This discipline improved its efficiency with the arrival, in the 20th century, of digital computer science. However, the computational limitations related to exponential time type problems in digital processors, triggered the search for more efficient alternatives. One of these choices is quantum computing. Certainly, quantum processors seem to be able to solve some of these complex problems, at least in theory. For this reason, in recent times, many research works have emerged related to the field of quantum game theory. In this paper we review the main studies about the subject, including operational requirements and implementation details. In addition, we describe various quantum games, their design strategy, and the used supporting tools. We also present the still open debate linked to the interpretation of the transformations of classical algorithms in fundamental game theory to their quantum version, with special attention to the Nash equilibrium.
This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.