The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
Thomas BrihayeVéronique BruyèreAline GoeminneJean-François RaskinMarie van den BogaardPublished in: Log. Methods Comput. Sci. (2020)
Keyphrases
- nash equilibria
- subgame perfect
- nash equilibrium
- game theory
- incomplete information
- game theoretic
- stochastic games
- fictitious play
- pure strategy
- worst case
- solution concepts
- multiagent learning
- computational cost
- quantitative and qualitative
- computational complexity
- neural network
- qualitative and quantitative
- pure nash equilibria
- congestion games
- decision problems
- state space
- multi agent systems
- cooperative
- learning algorithm