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

03/15/2019
by   Christoph Roch, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset