Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
type: Item
instance of: scholarly article
title: Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
zbMATH Open document ID: 1408.90308
author: Eugene A. Feinberg
author: Jefferson Huang
author: Bruno Scherrer
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: Feinberg Huang Scherrer.pdf
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6945294
zbMATH Keywords: Markov decision process
zbMATH Keywords: modified policy iteration
zbMATH Keywords: strongly polynomial
zbMATH Keywords: policy
zbMATH Keywords: algorithm
MaRDI profile type: Publication
OpenAlex ID: W2088147131
Wikidata QID: Q115038539
cites work: Q4257216
cites work: Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems
cites work: The value iteration algorithm is not strongly polynomial for discounted dynamic programming
cites work: Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
cites work: Q3266141
cites work: Q4547434
cites work: A bound for the number of different basic solutions generated by the simplex method
cites work: The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
cites work: Q4315289
cites work: Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
cites work: Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
cites work: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
DOI: 10.1016/J.ORL.2014.07.006
Recommended article: The value iteration algorithm is not strongly polynomial for discounted dynamic programming
Recommended article: Q3323813
Recommended article: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
Recommended article: A note on policy algorithms for discounted Markov decision problems
Recommended article: An Efficient Policy Iteration Algorithm for Dynamic Programming Equations
Recommended article: A policy iteration algorithm for fixed point problems with nonexpansive operators
Recommended article: Q3755250
Recommended article: Q3783097
Recommended article: Improved and Generalized Upper Bounds on the Complexity of Policy Iteration
description: scientific article; zbMATH DE number 6945294