The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).
Thomas BrihayeVéronique BruyèreAline GoeminneJean-François RaskinMarie van den BogaardPublished in: CoRR (2019)
Keyphrases
- nash equilibria
- subgame perfect
- nash equilibrium
- game theory
- game theoretic
- incomplete information
- pure strategy
- worst case
- stochastic games
- fictitious play
- solution concepts
- decision problems
- multiagent learning
- mixed strategy
- pure nash equilibria
- state space
- space complexity
- qualitative and quantitative
- congestion games
- data sets
- computer games
- fixed point
- autonomous agents
- computational cost
- lower bound
- computational complexity
- optimal solution