Related papers: Equivalence between Random Stopping Times in Conti…
Usual quantum mechanics predicts probabilities for the outcomes of measurements carried out at definite moments of time. However, realistic measurements do not take place in an instant, but are extended over a period of time. The assumption…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
This work deals with both instantaneous uniform mixing property and temporal standard deviation for continuous-time quantum random walks on circles in order to study their fluctuations comparing with discrete-time quantum random walks, and…
We prove quenched laws of hitting time statistics for random subshifts of finite type. In particular we prove a dichotomy between the law for periodic and for non-periodic points. We show that this applies to random Gibbs measures.
We consider transient nearest-neighbor random walks in random environment on Z. For a set of environments whose probability is converging to 1 as time goes to infinity, we describe the fluctuations of the hitting time of a level n, around…
This paper establishes an equivalence between the halting problem in computability theory and the convergence of power series in mathematical analysis.
We state and prove Kuhn's equivalence theorem for a new representation of games, the intrinsic form. First, we introduce games in intrinsic form where information is represented by $\sigma$-fields over a product set. For this purpose, we…
Recently, D. Williams \cite{williams} gave an explicit example of a random time $\rho $ associated with Brownian motion such that $\rho $ is not a stopping time but $\mathbb{E}M_{\rho}=\mathbb{E}M_{0}$ for every bounded martingale $M$. The…
We define the hitting (or absorbing) time for the case of continuous quantum walks by measuring the walk at random times, according to a Poisson process with measurement rate $\lambda$. From this definition we derive an explicit formula for…
We develop a theory for solving continuous time optimal stopping problems for non-linear expectations. Our motivation is to consider problems in which the stopper uses risk measures to evaluate future rewards.
We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent…
Many decision problems in economics, information technology, and industry can be transformed to an optimal stopping of adapted random vectors with some utility function over the set of Markov times with respect to filtration build by the…
Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical…
We study a mean-field game of optimal stopping and investigate the existence of strong solutions via a connection with the Bank-El Karoui's representation problem. Under certain continuity assumptions, where the common noise is generated by…
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown…
We study a general formulation of the classical two-player Dynkin game in a discrete time Markovian setting. We identify an appropriate class of mixed strategies -- \textit{Markovian randomized stopping times} -- in which players stop at…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
By an analogy to the duality between the recurrence time and the longest match length, we introduce a quantity dual to the maximal repetition length, which we call the repetition time. Extending prior results, we sandwich the repetition…
Tracking the solution of time-varying variational inequalities is an important problem with applications in game theory, optimization, and machine learning. Existing work considers time-varying games or time-varying optimization problems.…
In [4], we examined the use of coupling to obtain bounds on the mixing time of statistics on Markov chains. In the present paper, we consider the same general problem, but using strong stationary times rather than coupling. We discuss…