Related papers: Markov additive friendships
In this article, relying on Foster-Lyapunov drift conditions, we establish subexponential upper and lower bounds on the rate of convergence in the $\mathrm{L}^p$-Wasserstein distance for a class of irreducible and aperiodic Markov…
We consider finite and infinite systems of particles on the real line and half-line evolving in continuous time. Hereby, the particles are driven by i.i.d. L\'{e}vy processes endowed with rank-dependent drift and diffusion coefficients. In…
We propose an alternative approach for solving a number of well-studied optimal stopping problems for L\'evy processes. Instead of the usual method of guess-and-verify based on martingale properties of the value function, we suggest a more…
In this paper, we develop a new mathematical technique which allows us to express the joint distribution of a Markov process and its running maximum (or minimum) through the marginal distribution of the process itself. This technique is an…
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
The problem of constrained Markov decision process is considered. An agent aims to maximize the expected accumulated discounted reward subject to multiple constraints on its costs (the number of constraints is relatively small). A new dual…
We introduce an algorithm for the pricing of finite expiry American options driven by L\'evy processes. The idea is to tweak Carr's `Canadisation' method, cf. Carr [9] (see also Bouchard et al [5]), in such a way that the adjusted algorithm…
We study infinite-horizon Markov decision processes (MDPs) where the decision maker evaluates each of her strategies by aggregating the infinite stream of expected stage-rewards. The crucial feature of our approach is that the aggregation…
Markov-modulated L\'evy processes with two different regimes of restarting are studied. These regimes correspond to the completely renewed process and to the process of Markov modulation, accompanied by jumps. We give explicit expressions…
We study optimal Markovian couplings of Markov processes, where the optimality is understood in terms of minimization of concave transport costs between the time-marginal distributions of the coupled processes. We provide explicit…
Lifted Markov chains are Markov chains on graphs with added local "memory" and can be used to mix towards a target distribution faster than their memoryless counterparts. Upper and lower bounds on the achievable performance have been…
The optimal stopping problem for a Hunt processes on $\R$ is considered via the representation theory of excessive functions. In particular, we focus on infinite horizon (or perpetual) problems with one-sided structure, that is, there…
This paper develops ideas from a previous paper described as `an appetizer for non-linear Wiener--Hopf theory', but is completely independent of that paper. It again considers only the simplest possible case in which the underlying motion…
We provide a criterion for establishing lower bounds on the rate of convergence in $f$-variation of a continuous-time ergodic Markov process to its invariant measure. The criterion consists of novel super- and submartingale conditions for…
The time to converge to the steady state of a finite Markov chain can be greatly reduced by a lifting operation, which creates a new Markov chain on an expanded state space. For a class of quadratic objectives, we show an analogous behavior…
A $k$-height on a graph $G=(V, E)$ is an assignment $V\to\{0, \ldots, k\}$ such that the value on ajacent vertices differs by at most $1$. We study the Markov chain on $k$-heights that in each step selects a vertex at random, and, if…
Our first result concerns a characterisation by means of a functional equation of Poisson point processes conditioned by the value of their first moment. It leads to a generalised version of Mecke's formula. En passant, it also allows to…
We give an interpretation of the bilateral exit problem for L\'{e}vy processes via the study of an elementary Markov chain. We exhibit a strong connection between this problem and Krein's theory on strings. For instance, for symmetric…
In this note we apply the recently established Wiener-Hopf Monte Carlo (WHMC) simulation technique for Levy processes from Kuznetsov et al. [17] to path functionals, in particular first passage times, overshoots, undershoots and the last…
A L\'evy processes resurrected in the positive half-line is a Markov process obtained by removing successively all jumps that make it negative. A natural question, given this construction, is whether the resulting process is absorbed at 0…