Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.

Krishnendu Chatterjee Wolfgang Dvorák Monika Henzinger Alexander Svozil

Published in: CONCUR (2019)

Keyphrases

reinforcement learning
data structure
graph theory
learning algorithm
computational cost
worst case
optimization problems
computational complexity
computationally efficient
factored mdps