Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model (Q6302549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model |
scientific article; zbMATH DE number 900350971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model |
scientific article; zbMATH DE number 900350971 |
Statements
5 June 2018
0 references
math.OC
0 references
