The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
Thomas BrihayeVéronique BruyèreAline GoeminneJean-François RaskinMarie van den BogaardPublished in: CONCUR (2019)
Keyphrases
- nash equilibria
- subgame perfect
- nash equilibrium
- game theory
- incomplete information
- game theoretic
- stochastic games
- fictitious play
- pure strategy
- worst case
- solution concepts
- decision problems
- computational complexity
- mixed strategy
- space complexity
- data sets
- multi agent systems
- neural network
- quantitative measures
- resource allocation
- search algorithm
- cooperative
- pure nash equilibria
- pure nash equilibrium