English
Related papers

Related papers: One step futher: an explicit solution to Robbins' …

200 papers

Consider a sum $S_n=v_i\varepsilon_1+\cdots+v_n\varepsilon_{n}$, where $(v_i)^{n}_{i=1}$ are non-zero vectors in $\mathbb{R}^{d}$ and $(\varepsilon_i)^{n}_{i=1}$ are independent Rademacher random variables (i.e.,…

Probability · Mathematics 2019-10-23 Dainius Dzindzalieta , Tomas Juškevičius

We consider an optimal stopping time problem related with many models found in real options problems. The main goal of this work is to bring for the field of real options, different and more realistic pay-off functions, and negative…

Optimization and Control · Mathematics 2017-01-10 Manuel Guerra , Cláudia Nunes , Carlos Oliveira

We consider a limit theorem for the distribution of a r.v. $Y_n:=argmax {\{X_i, i= 1,..., n\}},$ where $X_i'$s are independent continuous non-negative random variables. The r.v.'s $\{X_i, i=1,..., n\}$, may be interpreted as the gains of…

Probability · Mathematics 2024-02-07 Youri Davydov , Vladimir Rotar

Given a probability distribution in R^n with general (non-white) covariance, a classical estimator of the covariance matrix is the sample covariance matrix obtained from a sample of N independent points. What is the optimal sample size N =…

Probability · Mathematics 2014-05-21 Roman Vershynin

Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…

Probability · Mathematics 2024-10-22 Alexander Gnedin , Zakaria Derbazi

An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an $\alpha$-maxmin nonlinear…

Mathematical Finance · Quantitative Finance 2021-07-15 Yu-Jui Huang , Xiang Yu

The maximality principle has been a valuable tool in identifying the free-boundary functions that are associated with the solutions to several optimal stopping problems involving one-dimensional time-homogeneous diffusions and their running…

Probability · Mathematics 2025-05-27 Neofytos Rodosthenous , Mihail Zervos

Let $X_n,...,X_1$ be i.i.d. random variables with distribution function $F$. A statistician, knowing $F$, observes the $X$ values sequentially and is given two chances to choose $X$'s using stopping rules. The statistician's goal is to stop…

Probability · Mathematics 2007-06-13 David Assaf , Larry Goldstein , Ester Samuel-Cahn

We consider the optimal stopping of a class of spectrally negative jump diffusions. We state a set of conditions under which the value is shown to have a representation in terms of an ordinary nonlinear programming problem. We establish a…

Pricing of Securities · Quantitative Finance 2013-02-19 Luis H. R. Alvarez E. , Pekka Matomäki , Teppo A. Rakkolainen

We formulate an optimal stopping problem for a geometric Brownian motion where the probability scale is distorted by a general nonlinear function. The problem is inherently time inconsistent due to the Choquet integration involved. We…

Probability · Mathematics 2022-01-07 Zuo Quan Xu , Xun Yu Zhou

We consider a class of problems related to variable knockout, where knockout means set a variable to zero. Given an optimisation problem formulated as a zero-one integer program the question we consider in this paper is what might be an…

Optimization and Control · Mathematics 2023-10-25 J. E. Beasley

Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are $n$ of them and they are revealed one by one. However, we do not know their values but only their relative ranks. We want to stop on recently…

Combinatorics · Mathematics 2019-04-30 Ewa M. Kubicka , Grzegorz Kubicki , Małgorzata Kuchta , Małgorzata Sulkowska

For a random variable $N = 0, 1, 2, \ldots$ we study the following question: When does the sum of $N$ many independent and identically distributed copies of a random variable $X$ have the same law a a nontrivial rescaling of $X$? We show…

Probability · Mathematics 2026-04-03 Andrey Sarantsev

One way to interpret the classical secretary problem (CSP) is to consider it as a special case of the following problem. We observe $n$ independent indicator variables $I_1,I_2,\dotsc,I_n$ sequentially and we try to stop on the last…

Probability · Mathematics 2013-09-13 Rémi Dendievel

We study the fundamental problem of sampling independent events, called subset sampling. Specifically, consider a set of $n$ events $S=\{x_1, \ldots, x_n\}$, where each event $x_i$ has an associated probability $p(x_i)$. The subset sampling…

Data Structures and Algorithms · Computer Science 2023-09-22 Lu Yi , Hanzhi Wang , Zhewei Wei

Bruss's odds theorem \cite{Bruss1} addresses the problem of determining the optimal stopping time for sequences of independent indicator functions. In this note, we derive upper and lower bounds for the success probability under the optimal…

Probability · Mathematics 2025-11-27 A. M. Kabaeva , A. V. Logachov , A. A. Yambartsev

Optimal stopping problems give rise to random distributions describing how many applicants the decision-maker will sample or interview before choosing one, a quantity sometimes referred to as the search time or process duration. This…

Applications · Statistics 2019-12-13 Simon Demers

This paper considers the problem of determining an optimal control action based on observed data. We formulate the problem assuming that the system can be modelled by a nonlinear state-space model, but where the model parameters, state and…

Optimization and Control · Mathematics 2021-07-02 Johannes N. Hendriks , James R. Z. Holdsworth , Adrian G. Wills , Thomas B. Schon , Brett Ninness

We study the optimal stopping problem of maximizing the variance of an unkilled linear diffusion. Especially, we demonstrate how the problem can be solved as a convex two-player zero-sum game, and reveal quite surprising application of game…

Probability · Mathematics 2020-03-25 Kamille Sofie Tågholt Gad , Pekka Matomäki

We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version,…

Discrete Mathematics · Computer Science 2019-07-23 Maciej Drwal