Metraipolis › archive › dc_e90d5b8ea517
Strategic Interview Positioning under Uncertain Self-Rank — arXiv:2609.11826
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11826
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:06:16.667Z
- SHA-256 of the archived text
63abdb4e28ac6b44cdde91877d75dee10e67e9063338c825d7f1f89486c7071d- Stable URL of this page
https://metraipolis.com/documento/dc_e90d5b8ea517
How to cite
Strategic Interview Positioning under Uncertain Self-Rank — arXiv:2609.11826 — arXiv (en), https://arxiv.org/abs/2609.11826 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e90d5b8ea517 (Metraipolis archive dc_e90d5b8ea517, sha256 63abdb4e28ac6b44cdde91877d75dee10e67e9063338c825d7f1f89486c7071d)
BibTeX
@misc{dce90d5b8ea517,
title = {Strategic Interview Positioning under Uncertain Self-Rank — arXiv:2609.11826},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11826},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e90d5b8ea517; sha256 63abdb4e28ac6b44cdde91877d75dee10e67e9063338c825d7f1f89486c7071d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11826. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study interview positioning in the secretary problem when an applicant is uncertain about their own absolute rank. The employer uses a given rejection threshold, and the applicant's self-rank distribution is truncated geometric. We show that the applicant need only compare the first eligible position with the final position and that, for finite $n$, a unique critical value exists precisely when $r(r+1)>n-1$. If $r_n$ is the employer's rejection threshold and $r_n/n\to\alpha\in(0,1)$ as $n\to\infty$, then \[ \lim_{n\to\infty}q_c(n,r_n) = q_c(\alpha) = \frac{1-\alpha}{1-\alpha+\alpha^2}. \] Thus uncertainty about absolute rank produces an explicit asymptotic phase transition in optimal interview positioning.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.11826 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:55:14.777Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).