A carregar...
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...
Na minha lista:
| Publicado no: | Computational Science – ICCS 2020 |
|---|---|
| Main Authors: | , , , , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7304779/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-50433-5_38 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|