Mapping Game Theory to Quantum Systems: Nash Equilibria via Neutral Atom Computing
- URL: http://arxiv.org/abs/2511.09841v1
- Date: Fri, 14 Nov 2025 01:12:31 GMT
- Title: Mapping Game Theory to Quantum Systems: Nash Equilibria via Neutral Atom Computing
- Authors: Giovanni Ferrannini, Dario di Gregorio, Federico Fissore,
- Abstract summary: Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science.<n>We exploit the correspondence between Maximum Independent Sets (MIS) and Nash equilibria on unit-disk graphs.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However, finding Nash equilibria is challenging due to its NP-Hard complexity, specifically within the PPAD class. By exploiting the correspondence between Maximum Independent Sets (MIS) and Nash equilibria on unit-disk graphs, we map these problems onto the ground state configurations of Rydberg atom arrays. Simulations show the effectiveness of this quantum method, highlighting its potential for solving complex problems in game theory.
Related papers
- Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation [8.784438985280092]
We study the existence and computation of Nash equilibria in continuous static games where the players' strategies are subject to shared coupling constraints.<n>Specifically, we focus on a class of games admissible by playerwise concave utilities and playerwise concave constraints.
arXiv Detail & Related papers (2025-09-17T14:33:49Z) - Determining Quantum Correlation through Nash Equilibria in Constant-Sum Games [0.0]
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations.
Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine quantum correlation.
arXiv Detail & Related papers (2024-10-20T14:27:01Z) - On Tractable $Φ$-Equilibria in Non-Concave Games [53.212133025684224]
We study tractable $Phi$-equilibria in non-concave games.<n>We show that when $Phi$ is finite, there exists an efficient uncoupled learning algorithm that converges to the corresponding $Phi$-equilibria.
arXiv Detail & Related papers (2024-03-13T01:51:30Z) - Multi-Sender Persuasion: A Computational Perspective [41.88812114165843]
We consider the multi-sender persuasion problem.
It is ubiquitous in computational economics, multi-agent learning, and machine learning.
We propose a novel differentiable neural network to approximate this game's non-linear and discontinuous utilities.
arXiv Detail & Related papers (2024-02-07T15:50:20Z) - A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [95.50895904060309]
We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.<n>This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
arXiv Detail & Related papers (2023-11-17T20:38:38Z) - Differentiable Arbitrating in Zero-sum Markov Games [59.62061049680365]
We study how to perturb the reward in a zero-sum Markov game with two players to induce a desirable Nash equilibrium, namely arbitrating.
The lower level requires solving the Nash equilibrium under a given reward function, which makes the overall problem challenging to optimize in an end-to-end way.
We propose a backpropagation scheme that differentiates through the Nash equilibrium, which provides the gradient feedback for the upper level.
arXiv Detail & Related papers (2023-02-20T16:05:04Z) - Game-Theoretical Perspectives on Active Equilibria: A Preferred Solution
Concept over Nash Equilibria [61.093297204685264]
An effective approach in multiagent reinforcement learning is to consider the learning process of agents and influence their future policies.
This new solution concept is general such that standard solution concepts, such as a Nash equilibrium, are special cases of active equilibria.
We analyze active equilibria from a game-theoretic perspective by closely studying examples where Nash equilibria are known.
arXiv Detail & Related papers (2022-10-28T14:45:39Z) - Quantum game theory and the complexity of approximating quantum Nash
equilibria [0.6091702876917281]
This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory.
In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is included in (and therefore complete for) the complexity class PPAD.
arXiv Detail & Related papers (2021-01-31T18:42:59Z) - No-regret learning and mixed Nash equilibria: They do not mix [64.37511607254115]
We study the dynamics of "follow-the-regularized-leader" (FTRL)
We show that any Nash equilibrium which is not strict cannot be stable and attracting under FTRL.
This result has significant implications for predicting the outcome of a learning process.
arXiv Detail & Related papers (2020-10-19T13:49:06Z) - Quantum Non-equilibrium Many-Body Spin-Photon Systems [91.3755431537592]
dissertation concerns the quantum dynamics of strongly-correlated quantum systems in out-of-equilibrium states.
Our main results can be summarized in three parts: Signature of Critical Dynamics, Driven Dicke Model as a Test-bed of Ultra-Strong Coupling, and Beyond the Kibble-Zurek Mechanism.
arXiv Detail & Related papers (2020-07-23T19:05:56Z) - Towards Prediction of Financial Crashes with a D-Wave Quantum Computer [2.733342606024131]
Prediction of financial crashes in a complex financial network is known to be an NP-hard problem.
We experimentally explore a novel approach to this problem by using a D-Wave quantum computer.
arXiv Detail & Related papers (2019-04-11T16:07:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.