Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
1705.07312
Cited By

Lower Bound On the Computational Complexity of Discounted Markov
Decision Problems

Lower Bound On the Computational Complexity of Discounted Markov Decision Problems

20 May 2017

ArXiv (abs)PDF HTML

Papers citing "Lower Bound On the Computational Complexity of Discounted Markov Decision Problems"

4 / 4 papers shown

On the hardness of RL with Lookahead

On the hardness of RL with Lookahead

Vianney Perchet

84

0

0

22 Oct 2025

Doubly-Asynchronous Value Iteration: Making Value Iteration Asynchronous
in Actions

Doubly-Asynchronous Value Iteration: Making Value Iteration Asynchronous in ActionsNeural Information Processing Systems (NeurIPS), 2022

216

1

0

04 Jul 2022

Variance Reduced Value Iteration and Faster Algorithms for Solving
Markov Decision Processes

Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision ProcessesACM-SIAM Symposium on Discrete Algorithms (SODA), 2017

274

136

0

27 Oct 2017

Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for
Ergodic Markov Decision Problems

π

Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems

233

71

0

17 Oct 2017