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

Krishnendu Chatterjee Wolfgang Dvorák Monika Henzinger Alexander Svozil

Published in: CoRR (2019)

Keyphrases

worst case
data structure
learning algorithm
optimization problems
reinforcement learning
significant improvement
computationally efficient
bipartite graph
graph theory
graph structure
factored mdps