On the public citation graph
Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
0 signed · 44 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.1002/nav.3800170210openalex-snapshot
On computing the expected discounted return in a markov chain
inferredcites →https://doi.org/10.1007/bf00933260openalex-snapshot
Discounted Markov games: Generalized policy iteration method
inferredcites →https://doi.org/10.1007/bf01917952openalex-snapshot
A decision exclusion algorithm for a class of Markovian Decision Processes
inferredcites →https://doi.org/10.1007/bf01920264openalex-snapshot
A set of successive approximation methods for discounted Markovian decision problems
inferredcites →https://doi.org/10.1007/bf02276760openalex-snapshot
A successive approximation algorithm for an undiscounted Markov decision process
inferredcites →https://doi.org/10.1016/0022-247x(63)90017-9openalex-snapshot
Dynamic programming, Markov chains, and the method of successive approximations
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.1016/0022-247x(71)90094-1openalex-snapshot
Iterative solution of the functional equations of undiscounted Markov renewal programming
inferredcites →https://doi.org/10.1016/0022-247x(76)90288-2openalex-snapshot
Estimates for finite-stage dynamic programs
inferredcites →https://doi.org/10.1016/0022-247x(78)90174-9openalex-snapshot
Contraction mappings underlying undiscounted Markov decision problems
inferredcites →https://doi.org/10.1016/0022-247x(88)90051-0openalex-snapshot
Contraction mappings underlying undiscounted Markov decision problems—II
inferredcites →https://doi.org/10.1016/b978-0-12-568150-6.50022-2openalex-snapshot
ON APPROXIMATE SOLUTIONS OF FINITE-STAGE DYNAMIC PROGRAMS
inferredcites →https://doi.org/10.1017/s000186780003175xopenalex-snapshot
Geometric convergence of value-iteration in multichain Markov decision problems
inferredcites →https://doi.org/10.1017/s0305004100030991openalex-snapshot
The ergodic properties of non-homogeneous finite Markov chains
inferredcites →https://doi.org/10.1017/s0305004100033399openalex-snapshot
Weak ergodicity in non-homogeneous Markov chains
inferredcites →https://doi.org/10.1057/jors.1978.42openalex-snapshot
Contracting Markov Decision Processes
inferredcites →https://doi.org/10.1137/0710046openalex-snapshot
A Generalization of the Additive Correction Methods for the Iterative Solution of Matrix Equations
inferredcites →https://doi.org/10.1137/1009030openalex-snapshot
Contraction Mappings in the Theory Underlying Dynamic Programming
inferredcites →https://doi.org/10.1287/mnsc.18.1.7openalex-snapshot
Some Bounds for Discounted Sequential Decision Processes
inferredcites →https://doi.org/10.1287/mnsc.23.8.890openalex-snapshot
Discounting, Ergodicity and Convergence for Markov Decision Processes
inferredcites →https://doi.org/10.1287/mnsc.24.11.1127openalex-snapshot
Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
inferredcites →https://doi.org/10.1287/opre.11.6.938openalex-snapshot
Markov-Renewal Programming. I: Formulation, Finite Return Models
inferredcites →https://doi.org/10.1287/opre.19.1.244openalex-snapshot
Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes
inferredcites →https://doi.org/10.1287/opre.19.4.1081openalex-snapshot
Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
inferredcites →https://doi.org/10.1287/opre.23.4.761openalex-snapshot
Bounds and Transformations for Discounted Finite Markov Decision Chains
inferredcites →https://doi.org/10.1287/opre.26.2.350openalex-snapshot
Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.2307/2006365openalex-snapshot
The State of the Art in Numerical Analysis.
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/978-1-4615-0805-2_2openalex-snapshot
Finite State and Action MDPS
inferred← citeshttps://doi.org/10.1007/978-1-4899-0574-1_31openalex-snapshot
A Second bibliography on semi-Markov processes
inferred← citeshttps://doi.org/10.1007/bf01740509openalex-snapshot
On efficiency of linear programming applied to discounted Markovian decision problems
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/0305-0548(86)90028-6openalex-snapshot
Computational comparison of policy iteration algorithms for discounted markov decision processes
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90061-qopenalex-snapshot
Serial and parallel value iteration algorithms for discounted Markov decision processes
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80172-0openalex-snapshot
Chapter 8 Markov decision processes
inferred← citeshttps://doi.org/10.1057/jors.1995.50openalex-snapshot
On the Generation of Markov Decision Processes
inferred← citeshttps://doi.org/10.1287/opre.30.2.301openalex-snapshot
Action Elimination Procedures for Modified Policy Iteration Algorithms
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.42.5.940openalex-snapshot
Accelerating Procedures of the Value Iteration Algorithm for Discounted Markov Decision Processes, Based on a One-Step Lookahead Analysis
inferred← citeshttps://doi.org/10.1360/n012015-00041openalex-snapshot
A survey on semi-Markov decision processes
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.