ロード中...
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...
保存先:
| 出版年: | Computational Science – ICCS 2020 |
|---|---|
| 主要な著者: | , , , , , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
2020
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7304779/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-50433-5_38 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|