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

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 pha...

Descripción completa

Detalles Bibliográficos
Autores principales: Roch, Christoph, Phan, Thomy, Feld, Sebastian, Müller, Robert, Gabor, Thomas, Hahn, Carsten, Linnhoff-Popien, Claudia
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7304779/
http://dx.doi.org/10.1007/978-3-030-50433-5_38

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7304779/
http://dx.doi.org/10.1007/978-3-030-50433-5_38

Ejemplares similares