Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces
We study the policy iteration algorithm (PIA) for continuous-time jump Markov decision processes in general state and action spaces. The corresponding transition rates are allowed to be unbounded, and the reward rates may have neither upper nor lower ...
Quanxin Zhu +2 more
doaj +1 more source
Strong average optimality criterion for continuous-time Markov decision processes [PDF]
summary:This paper deals with continuous-time Markov decision processes with the unbounded transition rates under the strong average cost criterion. The state and action spaces are Borel spaces, and the costs are allowed to be unbounded from above and ...
Chen, Xian, Wei, Qingda
core +1 more source
Control Design for Untimed Petri Nets Using Markov Decision Processes
Design of control sequences for discrete event systems (DESs) has been presented modelled by untimed Petri nets (PNs). PNs are well-known mathematical and graphical models that are widely used to describe distributed DESs, including choices ...
Cherki Daoui, Dimitri Lefebvre
doaj
The existence and characterisation of duality of Markov processes in the Euclidean space [PDF]
This thesis examines the existence of dualMarkov processes and presents the full characterization of Markov processes in Euclidean space equipped with the natural order (the Pareto order).
Lee, Rui Xin
core
Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption. [PDF]
Blahoudek F +5 more
europepmc +1 more source
On incorporating forecasts into linear state space model Markov decision processes. [PDF]
de Chalendar JA, Glynn PW.
europepmc +1 more source
Learning parametric policies and transition probability models of markov decision processes from data. [PDF]
Xu T, Zhu H, Paschalidis IC.
europepmc +1 more source
Counterfactual Strategies for Markov Decision Processes
Counterfactuals are widely used in AI to explain how minimal changes to a model’s input can lead to a different output. However, established methods for computing counterfactuals typically focus on one-step decision-making, and are not directly applicable to sequential decision-making tasks.
Kobialka, Paul +6 more
openaire +5 more sources
Differentially Private Reward Functions in Markov Decision Processes: Policy Synthesis and Tradeoffs
Policy synthesis in Markov decision processes uses a known reward function to compute a policy that maximizes it. However, onlookers may infer reward functions by observing agents, which can reveal sensitive information.
Alexander Benvenuti +6 more
doaj +1 more source
We study data-driven computation of probabilistic controlled invariant sets (PCIS) for safety-critical reinforcement learning under unknown dynamics. Assuming a linear MDP model, we use regularized least squares and self-normalized confidence bounds to ...
Kazumune Hashimoto +5 more
doaj +1 more source

