English
Related papers

Related papers: Continuous-time Markov decision processes under th…

200 papers

This paper presents an online method that learns optimal decisions for a discrete time Markov decision problem with an opportunistic structure. The state at time $t$ is a pair $(S(t),W(t))$ where $S(t)$ takes values in a finite set…

Optimization and Control · Mathematics 2024-08-13 Michael J. Neely

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

Information Theory · Computer Science 2017-03-06 Parisa Mansourifard , Tara Javidi , Bhaskar Krishnamachari

In this paper we consider an infinite time horizon risk-sensitive optimal stopping problem for a Feller--Markov process with an unbounded terminal cost function. We show that in the unbounded case an associated Bellman equation may have…

Optimization and Control · Mathematics 2022-11-01 Damian Jelito , Łukasz Stettner

Risk sensitive decision making finds important applications in current day use cases. Existing risk measures consider a single or finite collection of random variables, which do not account for the asymptotic behaviour of underlying…

Risk Management · Quantitative Finance 2024-05-24 Shivam Patel , Vivek Borkar

Euclidean Markov decision processes are a powerful tool for modeling control problems under uncertainty over continuous domains. Finite state imprecise, Markov decision processes can be used to approximate the behavior of these infinite…

Artificial Intelligence · Computer Science 2020-06-29 Manfred Jaeger , Giorgio Bacci , Giovanni Bacci , Kim Guldstrand Larsen , Peter Gjøl Jensen

This paper studies the approximation of optimal control policies by quantized (discretized) policies for a very general class of Markov decision processes (MDPs). The problem is motivated by applications in networked control systems,…

Optimization and Control · Mathematics 2015-05-14 Naci Saldi , Serdar Yüksel , Tamás Linder

In this paper, we consider the discounted continuous-time Markov decision process (CTMDP) with a lower bounding function. In this model, the negative part of each cost rate is bounded by the drift function, say $w$, whereas the positive…

Optimization and Control · Mathematics 2016-12-05 Xin Guo , Alexey Piunovskiy , Yi Zhang

This paper analyzes the stability of optimal policies in the long-run stochastic control framework with an averaged risk-sensitive criterion for discrete-time MDPs on finite state-action space. In particular, we study the robustness of…

Optimization and Control · Mathematics 2025-09-23 Nicole Bäuerle , Marcin Pitera , Łukasz Stettner

In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given…

Pricing of Securities · Quantitative Finance 2015-03-13 Aleksandar Mijatovic , Martijn Pistorius

Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…

Probability · Mathematics 2021-04-13 Suryadeepto Nag

We consider average-cost Markov decision processes (MDPs) with Borel state and action spaces and universally measurable policies. For the nonnegative cost model and an unbounded cost model, we introduce a set of conditions under which we…

Optimization and Control · Mathematics 2019-01-14 Huizhen Yu

We consider zero-sum stochastic games for continuous time Markov decision processes with risk-sensitive average cost criterion. Here the transition and cost rates may be unbounded. We prove the existence of the value of the game and a…

Optimization and Control · Mathematics 2021-09-21 Mrinal K. Ghosh , Subrata Golui , Chandan Pal , Somnath Pradhan

For a large class of Markov Decision Processes, stationary (possibly randomized) policies are globally optimal. However, in Borel state and action spaces, the computation and implementation of even such stationary policies are known to be…

Optimization and Control · Mathematics 2014-04-29 Naci Saldi , Tamás Linder , Serdar Yüksel

For infinite-horizon average-cost criterion problems, there exist relatively few rigorous approximation and reinforcement learning results. In this paper, for Markov Decision Processes (MDPs) with standard Borel spaces, (i) we first provide…

Optimization and Control · Mathematics 2024-12-10 Ali Devran Kara , Serdar Yuksel

We study a class of infinite-horizon average-cost Markov Decision Processes (MDPs) whose reward and transition structures are nearly separable. For the totally separable baseline (that is, with no perturbation), we derive an explicit…

Optimization and Control · Mathematics 2025-10-28 Dhairya Kantawala

We study causal optimal transport in continuous time, with Markovian cost, between a finite-state Markov source and a diffusion target. By replacing the source with its conditional law given the observation of the target, we characterize…

Optimization and Control · Mathematics 2026-05-20 Julio Backhoff , Erhan Bayraktar , Ibrahim Ekren , Antonios Zitridis

In this paper we present a framework for risk-sensitive model predictive control (MPC) of linear systems affected by stochastic multiplicative uncertainty. Our key innovation is to consider a time-consistent, dynamic risk evaluation of the…

Optimization and Control · Mathematics 2018-04-26 Sumeet Singh , Yin-Lam Chow , Anirudha Majumdar , Marco Pavone

We propose in this work an original estimator of the conditional intensity of a marker-dependent counting process, that is, a counting process with covariates. We use model selection methods and provide a non asymptotic bound for the risk…

Statistics Theory · Mathematics 2008-10-24 F. Comte , S. Gaïffas , A. Guilloux

We introduce and study constrained Markov Decision Processes (cMDPs) with anytime constraints. An anytime constraint requires the agent to never violate its budget at any point in time, almost surely. Although Markovian policies are no…

Machine Learning · Computer Science 2024-06-14 Jeremy McMahan , Xiaojin Zhu

In the paper we study dependence of long run functionals and limit characteristics assuming that Borel measurable Markov controls converge pointwise. We consider two kinds of functionals: average cost per unit time and long run risk…

Probability · Mathematics 2024-12-03 Lukasz Stettner