相关论文: A sharp lower bound for choosing the maximum of an…

This note considers a variation of the full-information secretary problem where the random variables to be observed are independent and identically distributed. Consider $X_1,\dots,X_n$ to be an independent sequence of random variables, let…

Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

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…

We consider the best-choice problem for independent (not necessarily iid) observations $X_1, \cdots, X_n$ with the aim of selecting the sample minimum. We show that in this full generality the monotone case of optimal stopping holds and the…

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

In this paper, we investigate two variants of the secretary problem. In these variants, we are presented with a sequence of numbers $X_i$ that come from distributions $\mathcal{D}_i$, and that arrive in either random or adversarial order.…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Fix some $n \in \mathbb{N}$ and let $X_1, X_2,\dots, X_n$ be independent random variables drawn from the uniform distribution on $[0,1]$. A decision maker is shown the variables sequentially and, after each observation, must decide whether…

We consider the Last-Success-Problem with $n$ independent Bernoulli random variables with parameters $p_i>0$. We improve the lower bound provided by F.T. Bruss for the probability of winning and provide an alternative proof to the one given…

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

We give asymptotic lower bounds of the value for Bruss' optimal stopping problem with multiple stopping chances. It interestingly consists of the asymptotic threshold values in the optimal multiple stopping strategy. Another interesting…

In this article we derive the best possible upper bound for $E[\max{X_i}-\min_i{X_i}]$ under given means and variances on $n$ random variables $X_i$. The random vector $(X_1,...,X_n)$ is allowed to have any dependence structure, provided $E…

The classical secretary problem has been generalized over the years into several directions. In this paper we confine our interest to those generalizations which have to do with the more general problem of stopping on a last observation of…

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

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.,…

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

A central object in optimal stopping theory is the single-choice prophet inequality for independent, identically distributed random variables: Given a sequence of random variables $X_1,\dots,X_n$ drawn independently from a distribution $F$,…

The classical Erd\H{o}s-Littlewood-Offord problem concerns the random variable $X = a_1 \xi_1 + \dots + a_n \xi_n$, where $a_i \in \mathbb{R} \setminus \{0\}$ are fixed and $\xi_i \sim \text{Ber}(1/2)$ are independent. The…