On the public citation graph

An improved algorithm for solving communicating average reward Markov decision processes

0 signed · 27 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470316887openalex-snapshot
Markov Decision Processes
inferredcites →https://doi.org/10.1016/0167-6377(88)90062-4openalex-snapshot
Communicating MDPs: Equivalence and LP properties
inferredcites →https://doi.org/10.1017/s0001867800039409openalex-snapshot
Optimal decision procedures for finite Markov chains. Part II: Communicating systems
inferredcites →https://doi.org/10.1080/00401706.1988.10488425openalex-snapshot
Stochastic Modelling and Analysis
inferredcites →https://doi.org/10.1145/364063.364082openalex-snapshot
Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
inferredcites →https://doi.org/10.1214/aoms/1177699146openalex-snapshot
Denumerable State Markovian Decision Processes-Average Cost Criterion
inferredcites →https://doi.org/10.1214/aoms/1177704593openalex-snapshot
Discrete Dynamic Programming
inferredcites →https://doi.org/10.1287/moor.12.1.163openalex-snapshot
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case
inferredcites →https://doi.org/10.1287/moor.16.1.195openalex-snapshot
Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
inferredcites →https://doi.org/10.1287/opre.35.1.121openalex-snapshot
Computing Optimal Policies for Controlled Tandem Queueing Systems
inferredcites →https://doi.org/10.2307/2004252openalex-snapshot
Dynamic Programming and Markov Processes.
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/9780470316887.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-0-585-33656-5_8openalex-snapshot
Average Reward Reinforcement Learning: Foundations, Algorithms, and Empirical Results
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-4757-3561-1_5openalex-snapshot
On Optimal Policies of Multichain Finite State Compact Action Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_6openalex-snapshot
Dynamic Power Management for Sensor Node in WSN Using Average Reward MDP
inferred← citeshttps://doi.org/10.1007/bf00114727openalex-snapshot
Average reward reinforcement learning: Foundations, algorithms, and empirical results
inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.006openalex-snapshot
On some algorithms for limiting average Markov decision processes
inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00055-5openalex-snapshot
A decomposition algorithm for limiting average Markov decision problems
inferred← citeshttps://doi.org/10.1023/a:1018064306595openalex-snapshot
Average Reward Reinforcement Learning: Foundations, Algorithms, and Empirical Results
inferred← citeshttps://doi.org/10.1109/cnds.2011.5764564openalex-snapshot
A new approach for power management in sensor node based on reinforcement learning
inferred← citeshttps://doi.org/10.1109/iccsn.2010.30openalex-snapshot
A Power Control Mechanism for Sensor Node Based on Dynamic Programming
inferred← citeshttps://doi.org/10.1137/0331018openalex-snapshot
Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
inferred← citeshttps://doi.org/10.1155/2010/659432openalex-snapshot
Exact Decomposition Approaches for Markov Decision Processes: A Survey
inferred← citeshttps://doi.org/10.1287/moor.2016.0812openalex-snapshot
Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains
inferred← citeshttps://doi.org/10.1287/moor.28.3.553.16388openalex-snapshot
An Algorithm to Identify and Compute Average Optimal Policies in Multichain 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.