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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games
Creator	Feld, Sebastian Gabor, Thomas Hahn, Carsten Linnhoff-Popien, Claudia Müller, Robert Phan, Thomy Roch, Christoph
Source	PMC
abstract	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 the Iterated Best Response heuristic.
has issue date	2020-05-25(xsd:dateTime)
bibo:doi	10.1007/978-3-030-50433-5_38
has license	no-cc
sha1sum (hex)	bf322a69866d30a41b70b83241ab8433e0e82fb0
schema:url	https://doi.org/10.1007/978-3-030-50433-5_38
resource representing a document's title	A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games
has PubMed Central identifier	PMC7304779
schema:publication	Computational Science - ICCS 2020
resource representing a document's body	covid:bf322a69866d30a41b70b83241ab8433e0e82fb0#body_text
is schema:about of	named entity 'computation' named entity 'phase' named entity 'quantum annealing' named entity 'Force' named entity 'determines' named entity 'Nash Equilibria' named entity 'CLASSICAL' named entity 'OPTIMIZATION' named entity 'FORCE' named entity '27S' named entity 'QUANTUM' named entity 'DIFFERENT' named entity 'FORMULATION' named entity 'WAVE' named entity 'D-Wave' named entity 'pure' named entity 'game' named entity 'strategies' named entity 'graphical' named entity 'Set Cover problem' named entity 'computing' named entity 'Brute Force algorithm' named entity 'D-Wave' named entity 'Graphical Games' named entity 'Nash equilibrium' named entity 'algorithm' named entity 'QUBO' named entity 'Set Cover problem' named entity 'algorithm' named entity 'QUBO' named entity 'matrices' named entity 'topology' named entity 'algorithm' named entity 'qubits' named entity 'spin glass' named entity 'binary variable' named entity 'Topology' named entity 'strategy set' named entity 'decision problem' named entity 'polynomial time' named entity 'decision problems' named entity 'functional form' named entity 'randomly generated' named entity 'vertices' named entity 'dependency graph' named entity 'D-Wave' named entity 'qubits' named entity 'strategy profile' named entity 'algorithm' named entity 'algorithm' named entity 'pure strategy' named entity 'belief propagation' named entity 'Multiple players' named entity 'graph' named entity 'Nash Equilibria' named entity 'strategy profile' named entity 'computing' named entity 'qubits' named entity 'graph' named entity 'strategy profile' named entity 'payoff matrix' named entity 'binary variable' named entity 'battle of the sexes' named entity 'Nash equilibrium' named entity 'graph' named entity 'quantum annealing' named entity 'QUBO' named entity 'strategy profile' named entity 'quantum annealing' named entity 'quantum processors' named entity 'QUBO' named entity 'algorithm' named entity 'quadratic unconstrained binary optimization' named entity 'qubits' named entity 'vertices' named entity 'metaheuristic' named entity 'quantum annealing'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software