Extending the V-sequence reduction to arbitrary independent distributions

Let $X_1,\ldots,X_n$ be independent random variables with arbitrary known distributions, where $n\ge2$. The optimal probability $V_n(X_1,\ldots,X_n)$ of choosing an overall maximum satisfies $V_n(X_1,\ldots,X_n)\ge(1-1/n)^{n-1}$, and this bound is attained. We obtain this known sharp bound by extending the reduction lemma of Allaart and Islas (2016) from continuous to arbitrary distributions. We construct a $V$-sequence whose optimal win probability does not exceed that of the original sequence, and then apply the bound for $V$-sequences. The construction first replaces atoms by uniform observations on strictly ordered intervals and applies the original continuous reduction lemma. The reduced distributions are determined by a common critical level and a common probability for splitting a possible atom at that level.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35600
Primary Topic
Probability and Statistical Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Extending the V-sequence reduction to arbitrary independent distributions

José A. Islas
arXiv (Cornell University)
Probability and Statistical Research
preprint

Extending the V-sequence reduction to arbitrary independent distributions

José A. Islas
preprint en

Abstract

Let $X_1,\ldots,X_n$ be independent random variables with arbitrary known distributions, where $n\ge2$. The optimal probability $V_n(X_1,\ldots,X_n)$ of choosing an overall maximum satisfies $V_n(X_1,\ldots,X_n)\ge(1-1/n)^{n-1}$, and this bound is attained. We obtain this known sharp bound by extending the reduction lemma of Allaart and Islas (2016) from continuous to arbitrary distributions. We construct a $V$-sequence whose optimal win probability does not exceed that of the original sequence, and then apply the bound for $V$-sequences. The construction first replaces atoms by uniform observations on strictly ordered intervals and applies the original continuous reduction lemma. The reduced distributions are determined by a common critical level and a common probability for splitting a possible atom at that level.

arXiv (Cornell University)
Probability and Statistical Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon