English
Related papers

Related papers: Optimal Stopping under G-expectation

200 papers

We consider a class of exit--time control problems for nonlinear systems with a nonnegative vanishing Lagrangian. In general, the associated PDE may have multiple solutions, and known regularity and stability properties do not hold. In this…

Optimization and Control · Mathematics 2018-05-10 Monica Motta , Caterina Sartori

In this work we consider optimal stopping problems with conditional convex risk measures called optimised certainty equivalents. Without assuming any kind of time-consistency for the underlying family of risk measures, we derive a novel…

Mathematical Finance · Quantitative Finance 2014-12-16 Denis Belomestny , Volker Kraetschmer

In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty…

Probability · Mathematics 2019-07-05 Nicole Bäuerle , Anton Popp

We study the valuation of an American put option with a random time horizon given by the last exit time of the underlying asset from a fixed level. Since this random time is not a stopping time, the problem falls outside the classical…

Probability · Mathematics 2026-03-31 Zhuoshu Wu , Libo Li

We consider the optimal double stopping time problem defined for each stopping time $S$ by $v(S)=\esssup\{E[\psi(\tau_1, \tau_2) | \F_S], \tau_1, \tau_2 \geq S \}$. Following the optimal one stopping time problem, we study the existence of…

Probability · Mathematics 2009-09-21 Magdalena Kobylanski , Marie-Claire Quenez , Elisabeth Rouy-Mironescu

In this paper we solve the hedge fund manager's optimization problem in a model that allows for investors to enter and leave the fund over time depending on its performance. The manager's payoff at the end of the year will then depend not…

Portfolio Management · Quantitative Finance 2014-03-04 Moritz Duembgen , L. C. G. Rogers

This work addresses the classic machine learning problem of online prediction with expert advice. A new potential-based framework for the fixed horizon version of this problem has been recently developed using verification arguments from…

Machine Learning · Computer Science 2020-07-02 Vladimir A. Kobzar , Robert V. Kohn , Zhilei Wang

In this paper, we study the optimal stopping problem in the so-called exploratory framework, in which the agent takes actions randomly conditioning on current state and an entropy-regularized term is added to the reward functional. Such a…

Optimization and Control · Mathematics 2023-09-04 Yuchao Dong

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's…

Optimization and Control · Mathematics 2018-06-05 Randall Martyr

In this paper we consider stopping problems with partial observation under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. Our aim is to maximize the certainty equivalent of the stopping…

Optimization and Control · Mathematics 2017-03-29 Nicole Bäuerle , Ulrich Rieder

We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomized) stopping strategy that maximizes the expected value of the offer in the sequence at which we stop. Instead of assuming to know the…

Optimization and Control · Mathematics 2025-07-08 Pieter Kleer , Daan Noordenbos

We address an optimal stopping problem over the set of Bermudan-type strategies $\Theta$ (which we understand in a more general sense than the stopping strategies for Bermudan options in finance) and with non-linear operators (non-linear…

Optimization and Control · Mathematics 2023-01-27 Miryana Grigorova , Marie-Claire Quenez , Peng Yuan

We consider optimal transport problems where the cost is optimized over controlled dynamics and the end time is free. Unlike the classical setting, the search for optimal transport plans also requires the identification of optimal "stopping…

Optimization and Control · Mathematics 2018-07-09 Nassif Ghoussoub , Young-Heon Kim , Aaron Zeff Palmer

Our purpose is to study a particular class of optimal stopping problems for Markov processes. We justify the value function convexity and we deduce that there exists a boundary function such that the smallest optimal stopping time is the…

Probability · Mathematics 2013-07-22 Diana Dorobantu

In this paper, we present a discrete-type approximation scheme to solve continuous-time optimal stopping problems based on fully non-Markovian continuous processes adapted to the Brownian motion filtration. The approximations satisfy…

Probability · Mathematics 2019-06-24 Dorival Leão , Alberto Ohashi , Francesco Russo

The objective of this paper is to establish the decomposition theorem for supermartingales under the $G$-framework. We first introduce a $g$-nonlinear expectation via a kind of $G$-BSDE and the associated supermartingales. We have shown…

Probability · Mathematics 2020-11-10 Hanwu Li , Shige Peng , Yongsheng Song

In a classical problem for the stopping of a diffusion process $(X_t)_{t \geq 0}$, where the goal is to maximise the expected discounted value of a function of the stopped process ${\mathbb E}^x[e^{-\beta \tau}g(X_\tau)]$, maximisation…

Probability · Mathematics 2020-04-27 David Hobson

Last passage times arise in a number of areas of applied probability, including risk theory and degradation models. Such times are obviously not stopping times since they depend on the whole path of the underlying process. We consider the…

Probability · Mathematics 2018-06-01 Erik J. Baurdoux , J. M. Pedraza

In this paper, problems of optimal control are considered where in the objective function, in addition to the control cost there is a tracking term that measures the distance to a desired stationary state. The tracking term is given by some…

Optimization and Control · Mathematics 2020-06-15 Martin Gugat , Michael Schuster , Enrique Zuazua

In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…

Probability · Mathematics 2012-01-04 Andreas Faller , Ludger Rüschendorf
‹ Prev 1 3 4 5 6 7 10 Next ›