On the public citation graph
A set of successive approximation methods for discounted Markovian decision problems
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-247x(66)90060-6openalex-snapshot
A modified dynamic programming method for Markovian decision problems
inferredcites →https://doi.org/10.1057/jors.1969.78openalex-snapshot
The Repair Limit Replacement Method
inferredcites →https://doi.org/10.1111/j.1467-9574.1975.tb00238.xopenalex-snapshot
Discounted semi‐Markov decision processes: linear programming and policy iteration
inferredcites →https://doi.org/10.1137/1009030openalex-snapshot
Contraction Mappings in the Theory Underlying Dynamic Programming
inferredcites →https://doi.org/10.1214/aoms/1177700285openalex-snapshot
Discounted Dynamic Programming
inferredcites →https://doi.org/10.1287/mnsc.13.5.371openalex-snapshot
Linear Programming Solutions for Separable Markovian Decision Problems
inferredcites →https://doi.org/10.1287/mnsc.18.1.7openalex-snapshot
Some Bounds for Discounted Sequential Decision Processes
inferredcites →https://doi.org/10.1287/opre.15.3.559openalex-snapshot
Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
inferredcites →https://doi.org/10.1287/opre.21.3.848openalex-snapshot
Technical Note—Elimination of Suboptimal Actions in Markov Decision Problems
inferredcites →https://doi.org/10.2307/2282268openalex-snapshot
Dynamic Programming and Markov Processes.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.3800280406openalex-snapshot
Computing the discounted return in markov and semi‐markov chains
inferred← citeshttps://doi.org/10.1007/3-540-58843-4_17openalex-snapshot
Mapping discounted and undiscounted Markov Decision Problems onto Hopfield neural networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-0805-2_2openalex-snapshot
Finite State and Action MDPS
inferred← citeshttps://doi.org/10.1007/978-1-4899-7491-4_6openalex-snapshot
Control Optimization with Stochastic Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7491-4_7openalex-snapshot
Control Optimization with Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-1-4939-1384-8_13openalex-snapshot
Solving Markov Decision Processes via Simulation
inferred← citeshttps://doi.org/10.1007/978-3-662-00401-2_80openalex-snapshot
Value Oriented Successive Approximations for the Average Reward Markov Decision Process; some Results
inferred← citeshttps://doi.org/10.1007/978-94-010-9910-3_61openalex-snapshot
Stopping Times and Markov Programming
inferred← citeshttps://doi.org/10.1007/bf01415991openalex-snapshot
Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes
inferred← citeshttps://doi.org/10.1007/bf01719273openalex-snapshot
On theory and algorithms for Markov decision problems with the total reward criterion
inferred← citeshttps://doi.org/10.1007/bf01719500openalex-snapshot
The method of value oriented successive approximations for the average reward Markov decision process
inferred← citeshttps://doi.org/10.1007/bf01720020openalex-snapshot
The numerical exploitation of periodicity in Markov decision processes
inferred← citeshttps://doi.org/10.1007/bf01783952openalex-snapshot
Action-dependent stopping times and Markov decision process with unbounded rewards
inferred← citeshttps://doi.org/10.1007/bf01917094openalex-snapshot
Optimization of STEOR networks via Markov renewal programming
inferred← citeshttps://doi.org/10.1007/bf01919243openalex-snapshot
Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
inferred← citeshttps://doi.org/10.1007/bf02276760openalex-snapshot
A successive approximation algorithm for an undiscounted Markov decision process
inferred← citeshttps://doi.org/10.1007/s10479-012-1073-xopenalex-snapshot
(Approximate) iterated successive approximations algorithm for sequential decision processes
inferred← citeshttps://doi.org/10.1016/0022-247x(77)90210-4openalex-snapshot
Markov programming by successive approximations with respect to weighted supremum norms
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00208-8openalex-snapshot
A K-step look-ahead analysis of value iteration algorithms for Markov decision processes
inferred← citeshttps://doi.org/10.1016/0377-841x(79)90051-2openalex-snapshot
Decomposition for dynamic programming in production and inventory control
inferred← citeshttps://doi.org/10.1016/b978-0-12-568150-6.50008-8openalex-snapshot
DISCOUNTED AND UNDISCOUNTED VALUE-ITERATION IN MARKOV DECISION PROBLEMS: A SURVEY
inferred← citeshttps://doi.org/10.1016/j.automatica.2013.12.009openalex-snapshot
On integral generalized policy iteration for continuous-time linear quadratic regulations
inferred← citeshttps://doi.org/10.1016/j.est.2017.09.008openalex-snapshot
Optimized operation of hybrid battery systems for electric vehicles using deterministic and stochastic dynamic programming
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2022.12.028openalex-snapshot
GPI-Based design for partially unknown nonlinear two-player zero-sum games
inferred← citeshttps://doi.org/10.1016/j.procs.2011.08.046openalex-snapshot
Approximate Policy Iteration for Semi-Markov Control Revisited
inferred← citeshttps://doi.org/10.1016/j.procs.2012.09.036openalex-snapshot
Approximate Policy Iteration for Markov Control Revisited
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80172-0openalex-snapshot
Chapter 8 Markov decision processes
inferred← citeshttps://doi.org/10.1080/02331937908842597openalex-snapshot
Successive approximations for Markov decision processes and Markov games with unbounded rewards
inferred← citeshttps://doi.org/10.1080/02331938008842640openalex-snapshot
Über diskrete alternierende entseheidungsprozesse
inferred← citeshttps://doi.org/10.1080/02331938408842960openalex-snapshot
On iterative optimization ol structured Markov decision processes with discounted rewards
inferred← citeshttps://doi.org/10.1109/icftic54370.2021.9647264openalex-snapshot
Using MDP to Find the Best Path in Multi-floor World
inferred← citeshttps://doi.org/10.1109/spawc.2018.8445767openalex-snapshot
Adversarial Machine Learning: The Case of Recommendation Systems
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1985.tb01140.xopenalex-snapshot
MARKOV DECISION PROCESSES
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0305openalex-snapshot
Reinforcement Learning: A Tutorial Survey and Recent Advances
inferred← citeshttps://doi.org/10.1287/mnsc.24.11.1127openalex-snapshot
Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
inferred← citeshttps://doi.org/10.1287/opre.33.3.589openalex-snapshot
Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
inferred← citeshttps://doi.org/10.1287/opre.35.1.121openalex-snapshot
Computing Optimal Policies for Controlled Tandem Queueing Systems
inferred← citeshttps://doi.org/10.1287/opre.37.5.791openalex-snapshot
Solution Procedures for Partially Observed Markov Decision Processes
inferred← citeshttps://doi.org/10.2200/s00426ed1v01y201206aim017openalex-snapshot
Planning with Markov Decision Processes: An AI Perspective
inferred← citeshttps://doi.org/10.22004/ag.econ.32259openalex-snapshot
DYNAMIC PROGRAMMING: HAS ITS DAY ARRIVED?
inferred← citeshttps://doi.org/10.2307/2344822openalex-snapshot
Contracting Markov Decision Processes.
inferred← citeshttps://doi.org/10.3390/su11082288openalex-snapshot
Research on China’s Power Sustainable Transition Under Progressively Levelized Power Generation Cost Based on a Dynamic Integrated Generation–Transmission Planning Model
inferred← citeshttps://doi.org/10.48550/arxiv.1301.6751openalex-snapshot
A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.48550/arxiv.2009.12576openalex-snapshot
Inverse Rational Control with Partially Observable Continuous Nonlinear Dynamics
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.