English
Related papers

Related papers: Two choice optimal stopping

200 papers

The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…

Statistical Mechanics · Physics 2015-06-25 M. Bauer , C. Godreche , J. M. Luck

Suppose that at any stage of a statistical experiment a control variable $X$ that affects the distribution of the observed data $Y$ can be used. The distribution of $Y$ depends on some unknown parameter $\theta$, and we consider the…

Statistics Theory · Mathematics 2010-05-05 Andrey Novikov

Motivated by applications where impatience is pervasive and evaluation times are uncertain, we study a selection model where options may expire at an unknown point in time and evaluation times are stochastic. Initially, the decision-maker…

Optimization and Control · Mathematics 2026-02-05 Yihua Xu , Rohan Ghuge , Sebastian Perez-Salazar

Assuming that data are collected sequentially from independent streams, we consider the simultaneous testing of multiple binary hypotheses under two general setups; when the number of signals (correct alternatives) is known in advance, and…

Statistics Theory · Mathematics 2017-02-14 Yanglei Song , Georgios Fellouris

In our problem, we are given access to a number of sequences of nonnegative i.i.d. random variables, whose realizations are observed sequentially. All sequences are of the same finite length. The goal is to pick one element from each…

Statistics Theory · Mathematics 2024-02-06 Aristomenis Tsopelakos , Olgica Milenkovic

Consider an infinite sequence of independent, uniformly chosen points from $[0,1]^d$. After looking at each point in the sequence, an overseer is allowed to either keep it or reject it, and this choice may depend on the locations of all…

Probability · Mathematics 2017-09-05 Raaz Dwivedi , Ohad N. Feldheim , Ori Gurel-Gurevich , Aaditya Ramdas

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is…

Logic in Computer Science · Computer Science 2021-02-02 Edon Kelmendi , Julia Krämer , Jan Kretinsky , Maximilian Weininger

We introduce a model of graph-constrained dynamic choice with reinforcement modeled by positively $\alpha$-homogeneous rewards. We show that its empirical process, which can be written as a stochastic approximation recursion with Markov…

Optimization and Control · Mathematics 2021-07-27 Konstantin Avrachenkov , Vivek S. Borkar , Sharayu Moharir , Suhail M. Shah

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

Information Theory · Computer Science 2014-12-09 Jayakrishnan Unnikrishnan

In the high dimensional regression analysis when the number of predictors is much larger than the sample size, an important question is to select the important variable which are relevant to the response variable of interest. Variable…

Methodology · Statistics 2023-01-09 Pengsheng Ji , Zhigen Zhao

We consider the fundamental problem of selecting $k$ out of $n$ random variables in a way that the expected highest or second-highest value is maximized. This question captures several applications where we have uncertainty about the…

Computer Science and Game Theory · Computer Science 2020-12-16 Aranyak Mehta , Uri Nadav , Alexandros Psomas , Aviad Rubinstein

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

In this paper, a branching random walk $(V(x))$ in the boundary case is studied, where the associated one dimensional random walk is in the domain of attraction of an $\alpha-$stable law with $1<\alpha<2$. Let $M_n$ be the minimal position…

Probability · Mathematics 2017-12-27 Jingning Liu , Mei Zhang

Freidlin-Wentzell theory of large deviations can be used to compute the likelihood of extreme or rare events in stochastic dynamical systems via the solution of an optimization problem. The approach gives exponential estimates that often…

Statistical Mechanics · Physics 2021-09-17 Tobias Grafke , Tobias Schäfer , Eric Vanden-Eijnden

We study the stochastic motion of active particles that undergo spontaneous transitions between two distinct modes of motion. Each mode is characterized by a velocity distribution and an arbitrary (anti-)persistence. We present an…

Statistical Mechanics · Physics 2023-07-07 M. Reza Shaebani , Heiko Rieger , Zeinab Sadjadi

Let $\alpha_n(\cdot)=P\bigl(X_{n+1}\in\cdot\mid X_1,\ldots,X_n\bigr)$ be the predictive distributions of a sequence $(X_1,X_2,\ldots)$ of $p$-dimensional random vectors. Suppose $$\alpha_n= \mathcal{N} _p (M_n,Q_n)$$ where…

Statistics Theory · Mathematics 2024-09-17 Samuele Garelli , Fabrizio Leisen , Luca Pratelli , Pietro Rigo

In pure exploration problems, a statistician sequentially collects information to answer a question about some stochastic and unknown environment. The probability of returning a wrong answer should not exceed a maximum risk parameter…

Machine Learning · Computer Science 2026-02-19 Riccardo Poiani , Martino Bernasconi , Andrea Celli

We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player B, who wants…

Computer Science and Game Theory · Computer Science 2021-10-29 Benjamin Bordais , Patricia Bouyer , Stéphane Le Roux

We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service completion. This may…

Performance · Computer Science 2015-03-18 U. Ayesta , M. Erausquin , M. Jonckheere , I. M. Verloop
‹ Prev 1 3 4 5 6 7 10 Next ›