DeepAI AI Chat
Log In Sign Up

A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

by   Christoph Roch, et al.
Universität München

We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of finding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies for each player using classical computation. The second phase finds pure Nash equilibria using a quantum annealing device by mapping the computed combinations to a quadratic unconstrained binary optimization formulation based on the Set Cover problem. We empirically evaluate Q-Nash on D-Wave's Quantum Annealer 2000Q using different graphical game topologies. The results with respect to solution quality and computing time are compared to a Brute Force algorithm and a Random Search heuristic.


Tight Inapproximability for Graphical Games

We provide a complete characterization for the computational complexity ...

Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games

In this paper, we study the problem of learning the set of pure strategy...

Calculating Nash equilibrium and Nash bargaining solution on quantum annealers

Adiabatic quantum computing is implemented on specialized hardware using...

Finding Nash Equilibria of Two-Player Games

This paper is an exposition of algorithms for finding one or all equilib...

Representing Pure Nash Equilibria in Argumentation

In this paper we describe an argumentation-based representation of norma...

Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach

We introduce the reinforcement quantum annealing (RQA) scheme in which a...

Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification

Combinatorial auctions (CAs) are mechanisms that are widely used in prac...