Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275): Difference between revisions

@@ Property / cites work @@
+Q4257216
@@ Property / cites work: Q4257216 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems
+Normal rank
@@ Property / cites work @@
+The value iteration algorithm is not strongly polynomial for discounted dynamic programming
+Normal rank
@@ Property / cites work @@
+Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
+Normal rank
@@ Property / cites work @@
+Q3266141
@@ Property / cites work: Q3266141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547434
@@ Property / cites work: Q4547434 / rank @@
+Normal rank
@@ Property / cites work @@
+A bound for the number of different basic solutions generated by the simplex method
+Normal rank
@@ Property / cites work @@
+The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
+Normal rank
@@ Property / cites work @@
+Q4315289
@@ Property / cites work: Q4315289 / rank @@
+Normal rank
@@ Property / cites work @@
+Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
+Normal rank
@@ Property / cites work @@
+Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
+Normal rank
@@ Property / cites work @@
+The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
+Normal rank