Metraipolis › archive › dc_07d2d0f6d540

One Empty Locker and Two Inspections: An Exact Optimal Team Strategy — arXiv:2608.13074

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13074
License (as archived)
CC0-1.0
Archived
2026-10-19T04:50:13.390Z
SHA-256 of the archived text
bbec0612d1f7ada824de44f478973117ef7fe6c9f930f20eb2d87966e626ed82
Stable URL of this page
https://metraipolis.com/documento/dc_07d2d0f6d540

How to cite

One Empty Locker and Two Inspections: An Exact Optimal Team Strategy — arXiv:2608.13074 — arXiv (en), https://arxiv.org/abs/2608.13074 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_07d2d0f6d540 (Metraipolis archive dc_07d2d0f6d540, sha256 bbec0612d1f7ada824de44f478973117ef7fe6c9f930f20eb2d87966e626ed82)
BibTeX
@misc{dc07d2d0f6d540,
  title = {One Empty Locker and Two Inspections: An Exact Optimal Team Strategy — arXiv:2608.13074},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13074},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_07d2d0f6d540; sha256 bbec0612d1f7ada824de44f478973117ef7fe6c9f930f20eb2d87966e626ed82},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13074. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study a cooperative search game with $N$ lockers, $N-1$ labelled objects, one empty locker, and $N-1$ players. Player $i$ seeks object $i$ and may inspect at most two lockers; the second inspection may depend on the content of the first. The players may coordinate beforehand but receive no information about the searches of other players after play begins. We prove that the maximum probability that every player finds the assigned object is $I_N/N!$, where $I_N$ is the number of involutions of $N$ elements. An optimal strategy represents the blank by the common fictitious symbol $N$ and follows pointers: player $i$ first opens locker $i$, then opens the locker whose number was observed. The upper bound holds for every deterministic or randomized adaptive strategy and follows from a deletion lemma and two recurrences. We give explicit examples, identify the three-door case with an isomorphic "Return of Monty Hall" game, and report a reproducible mixed-integer verification for $N=2,3,4,5$. The computation is independent of, and not needed for, the proof.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.13074 — 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-19T04:28:16.167Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).