46 citations · 69 across the 11 of their papers we have counts for
13 papers
Learning Optimal Search Strategies
Stefan Ankirchner, Maximilian Philipp Thiel
We explore the question of how to learn an optimal search strategy within the example of a parking problem where parking opportunities arrive according to an unknown inhomogeneous…
Properties of the EMCEL scheme for approximating irregular diffusions
Stefan Ankirchner, Thomas Kruse, Wolfgang Löhr +1
We prove several properties of the EMCEL scheme, which is capable of approximating one-dimensional continuous strong Markov processes in distribution on the path space (the scheme…
Wasserstein convergence rates for random bit approximations of continuous Markov processes
Stefan Ankirchner, Thomas Kruse, Mikhail Urusov
We determine the convergence speed of a numerical scheme for approximating one-dimensional continuous strong Markov processes. The scheme is based on the construction of coin tossi…
A functional limit theorem for coin tossing Markov chains
Stefan Ankirchner, Thomas Kruse, Mikhail Urusov
We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability , respectively. The theorem e…
The Skorokhod embedding problem for inhomogeneous diffusions
Stefan Ankirchner, Stefan Engelhardt, Alexander Fromm +1
We solve the Skorokhod embedding problem for a class of stochastic processes satisfying an inhomogeneous stochastic differential equation (SDE) of the form $d A_t =μ(t, A_t) d t +…
A functional limit theorem for irregular SDEs
Stefan Ankirchner, Thomas Kruse, Mikhail Urusov
Let be a sequence of i.i.d. real-valued random variables with mean zero, and consider the scaled random walk of the form $Y^N_{k+1} = Y^N_{k} + a_N(Y^N_k) X_{k+1…