On the public citation graph
Observer and control design in partially observable finite Markov chains
0 signed · 33 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.1007/s11081-018-9374-9openalex-snapshot
Sparse mean–variance customer Markowitz portfolio optimization for Markov chains: a Tikhonov’s regularization penalty approach
inferredcites →https://doi.org/10.1007/s11518-014-5260-yopenalex-snapshot
Simple computing of the customer lifetime value: A fixed local-optimal policy approach
inferredcites →https://doi.org/10.1016/0005-1098(88)90102-1openalex-snapshot
On model order estimation for partially observed Markov chains
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50052-9openalex-snapshot
Learning policies for partially observable environments: Scaling up
inferredcites →https://doi.org/10.1016/j.automatica.2011.04.005openalex-snapshot
Computation of approximate optimal policies in a partially observed inventory model with rain checks
inferredcites →https://doi.org/10.1016/j.automatica.2014.05.012openalex-snapshot
Reachability for partially observable discrete time stochastic hybrid systems
inferredcites →https://doi.org/10.1016/j.automatica.2016.04.044openalex-snapshot
Necessary and sufficient Karush–Kuhn–Tucker conditions for multiobjective Markov chains optimality
inferredcites →https://doi.org/10.1016/j.engappai.2015.08.011openalex-snapshot
A priori-knowledge/actor-critic reinforcement learning architecture for computing the mean–variance customer portfolio: The case of bank marketing campaigns
inferredcites →https://doi.org/10.1016/s0005-1098(02)00231-5openalex-snapshot
Self-learning control of finite Markov chains
inferredcites →https://doi.org/10.1080/00207179.2017.1362503openalex-snapshot
The mean squared loss control problem for a partially observed Markov chain
inferredcites →https://doi.org/10.1137/040611379openalex-snapshot
Finite Horizon Robust State Estimation for Uncertain Finite-Alphabet Hidden Markov Models with Conditional Relative Entropy Constraints
inferredcites →https://doi.org/10.1142/9789812701039openalex-snapshot
Mathematical Theory of Adaptive Control
inferredcites →https://doi.org/10.1142/s0218213018500343openalex-snapshot
A Reinforcement Learning Approach for Solving the Mean Variance Customer Portfolio in Partially Observable Models
inferredcites →https://doi.org/10.1201/9781482273274openalex-snapshot
Self-Learning Control of Finite Markov Chains
inferredcites →https://doi.org/10.1287/opre.1090.0697openalex-snapshot
Partially Observable Markov Decision Processes: A Geometric Technique and Analysis
inferredcites →https://doi.org/10.1901/jaba.2008.301-256openalex-snapshot
Reinforcement Learning with Limited Reinforcement: Using Bayes Risk for Active Learning in POMDPs.
inferredcites →https://doi.org/10.48550/arxiv.1401.3870openalex-snapshot
Learning to Make Predictions In Partially Observable Environments Without a Generative Model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-43575-1_3openalex-snapshot
Partially Observable Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-031-43575-1_8openalex-snapshot
Joint Observer and Mechanism Design
inferred← citeshttps://doi.org/10.1007/s10614-022-10240-yopenalex-snapshot
A Dynamic Mechanism Design for Controllable and Ergodic Markov Games
inferred← citeshttps://doi.org/10.1007/s40314-021-01578-4openalex-snapshot
A Markovian Stackelberg game approach for computing an optimal dynamic mechanism
inferred← citeshttps://doi.org/10.1016/j.engappai.2019.103415openalex-snapshot
Traffic-signal control reinforcement learning approach for continuous-time Markov games
inferred← citeshttps://doi.org/10.1016/j.engappai.2020.103876openalex-snapshot
A nucleus for Bayesian Partially Observable Markov Games: Joint observer and mechanism design
inferred← citeshttps://doi.org/10.1016/j.ins.2021.02.073openalex-snapshot
Robust H∞ observer-based sliding mode control for uncertain Takagi–Sugeno fuzzy descriptor systems with unmeasurable premise variables and time-varying delay
inferred← citeshttps://doi.org/10.1016/j.jocs.2023.101995openalex-snapshot
A tri-level approach for computing Stackelberg Markov game equilibrium: Computational analysis
inferred← citeshttps://doi.org/10.1080/01605682.2023.2195878openalex-snapshot
Revealing perceived individuals’ self-interest
inferred← citeshttps://doi.org/10.1109/tsp.2024.3423755openalex-snapshot
Multi-Objective Multi-Agent Planning for Discovering and Tracking Multiple Mobile Objects
inferred← citeshttps://doi.org/10.1177/09544100211053306openalex-snapshot
Kalman filter identification method for micro-vibration transfer paths of satellites
inferred← citeshttps://doi.org/10.1177/10775463251384140openalex-snapshot
A hierarchical identification method for optimal location of vibration suppression on transmission path in satellites
inferred← citeshttps://doi.org/10.24818/18423264/56.4.22.07openalex-snapshot
Optimal Constrained Portfolio Analysis for Incomplete Information and Transaction Costs
inferred← citeshttps://doi.org/10.3103/s875669902106011xopenalex-snapshot
Invariance of State Estimate for a Finite Markov Chain with Discrete Time
inferred← citeshttps://doi.org/10.32469/10355/93968openalex-snapshot
Learning-based wildfire tracking with unmanned aerial vehicles
inferred← citeshttps://doi.org/10.3390/math9040321openalex-snapshot
Analytical Method for Mechanism Design in Partially Observable Markov Games
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.