Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz.
Mark HodsonBrendan RuckHugh OngStefan DulmanDavid GarvinPublished in: CoRR (2020)
Keyphrases
- nash equilibrium
- pareto optimal
- game theory
- profit maximizing
- game theoretic
- worst case
- nash equilibria
- pure strategy
- mixed strategy
- solution concepts
- variational inequalities
- repeated games
- stochastic games
- stackelberg game
- congestion games
- fictitious play
- cooperative
- equilibrium strategies
- dynamic programming
- regret minimization
- pure nash equilibrium
- correlated equilibrium
- subgame perfect
- imperfect information
- evolutionary algorithm
- optimal strategy
- optimal control
- optimal solution