Related papers: Hazard processes and martingale hazard processes
We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of $\mathsf{BPTIME}$: proving hierarchy theorems and showing the existence of complete problems. Our main contributions can be…
In this paper, we consider the discrete-time setting, and the market model described by (S,F,T)$. Herein F is the ``public" flow of information which is available to all agents overtime, S is the discounted price process of d-tradable…
In this paper, we extend the results of Elliott and Yang \cite{elliott3} and discuss the control of a stochastic process for which the driving noise is provided by a martingale associated with a semi-Markov Chain. An existence and a…
In the first part of the paper, we study reflected backward stochastic differential equations (RBSDEs) with lower obstacle which is assumed to be right upper-semicontinuous but not necessarily right-continuous. We prove existence and…
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…
We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…
This paper considers the setting governed by $(\mathbb{F},\tau)$, where $\mathbb{F}$ is the "public" flow of information, and $\tau$ is a random time which might not be $\mathbb{F}$-observable. This framework covers credit risk theory and…
We develop a theory of optimal stopping problems under G-expectation framework. We first define a new kind of random times, called G-stopping times, which is suitable for this problem. For the discrete time case with finite horizon, the…
We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities $\mathcal{P}$. The maturity is specified as the hitting time to level $0$ of…
Experimentation involves risk. The investigator expends time and money in the pursuit of data that supports a hypothesis. In the end, the investigator may find that all of these costs were for naught and the data fail to reject the null.…
It is well-known that well-posedness of a martingale problem in the class of continuous (or r.c.l.l.) solutions enables one to construct the associated transition probability functions. We extend this result to the case when the martingale…
The paper develops no arbitrage results for trajectory based models by imposing general constraints on the trading portfolios. The main condition imposed, in order to avoid arbitrage opportunities, is a local continuity requirement on the…
This paper develops a structural credit risk model to characterize the difference between the economic and recorded default times for a firm. Recorded default occurs when default is recorded in the legal system. The economic default time is…
This paper addresses a continuous-time contracting model that extends the problem introduced by Sannikov and later rigorously analysed by Possama\"{i} and Touzi. In our model, a principal hires a risk-averse agent to carry out a project.…
The quality of numerical computations can be measured through their forward error, for which finding good error bounds is challenging in general. For several algorithms and using stochastic rounding (SR), probabilistic analysis has been…
In this paper we discuss a credit risk model with a pure jump L\'evy process for the asset value and an unobservable random barrier. The default time is the first time when the asset value falls below the barrier. Using the…
Average-case analysis computes the complexity of an algorithm averaged over all possible inputs. Compared to worst-case analysis, it is more representative of the typical behavior of an algorithm, but remains largely unexplored in…
In this paper, we consider the optimal stopping problem on semi-Markov processes (SMPs) with finite horizon, and aim to establish the existence and computation of optimal stopping times. To achieve the goal, we first develop the main…
We propose a method based on continuous time Markov chain approximation to compute the distribution of Parisian stopping times and price Parisian options under general one-dimensional Markov processes. We prove the convergence of the method…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…