Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.10452

A secretary for Messrs. Luce and Mallows

Ross G. Pinsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

We analyze the secretary problem in the case that the $n$ ranked items arrive not in uniformly random order but rather according to a certain type of Luce distribution or according to a Mallows distribution on the set $S_n$ of permutations of $[n]$. The secretary problem for the Mallows distributions with parameter $q\in(0,1)$ was analyzed in a previous paper; in this paper the case $q>1$ is also analyzed. The Luce distribution with the class $\{q_j\}_{j=1}^\infty$ of weights is related in a certain sense to the Mallows distribution with parameter $q$, but is more difficult to analyze. It turns out that for every $n$ and every strategy, the probabilities for the secretary problem when the smallest number is considered of highest rank for the Luce distribution with this class of weights coincides with those for the corresponding Mallows distribution. We analyze the asymptotic optimal strategy and corresponding limiting probability for the above cases, as well as for the Luce distributions with other classes of weights, such as the Sukhatme weights.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ross G. Pinsky. 2026-05-11. A secretary for Messrs. Luce and Mallows. https://arxiv.org/abs/2605.10452

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗
arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗
arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗