Metraipolis › archive › dc_676cd46749d0
Safe Observation Capacity for Opponent Exploitation under Showdown Censoring — arXiv:2608.09954
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09954
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:15:05.059Z
- SHA-256 of the archived text
a59f3fba3fafd59f1c52e7155260d2016e6091b967fec9d658aa58879cb50853- Stable URL of this page
https://metraipolis.com/documento/dc_676cd46749d0
How to cite
Safe Observation Capacity for Opponent Exploitation under Showdown Censoring — arXiv:2608.09954 — arXiv (en), https://arxiv.org/abs/2608.09954 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_676cd46749d0 (Metraipolis archive dc_676cd46749d0, sha256 a59f3fba3fafd59f1c52e7155260d2016e6091b967fec9d658aa58879cb50853)
BibTeX
@misc{dc676cd46749d0,
title = {Safe Observation Capacity for Opponent Exploitation under Showdown Censoring — arXiv:2608.09954},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09954},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_676cd46749d0; sha256 a59f3fba3fafd59f1c52e7155260d2016e6091b967fec9d658aa58879cb50853},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09954. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In poker-like games, folds hide private cards, so showdown data are missing not at random: per-card estimates converge to behavior conditional on reveal, and shrinking confidence sets can lose coverage. A floor-safe probe carries a line to showdown; sequence-form flow then recovers censored fold mass on reveal-certified histories. We price acquisition through safe observation capacity, the largest target reach attainable by a floor-safe plan at a given value slack. Its frontier is concave and piecewise linear, with initial slope given by the floor's shadow price. When that reach converts fully to reveal and parent flow is non-bottleneck, matching local bounds make the hands required for conditional-probability half-width $\varepsilon$ inversely proportional, up to logarithms, to capacity, opponent continuation mass, and $\varepsilon^2$. Safe Active De-censoring (SAD) combines public screening, an independent reveal batch, and robust deployment; a max-min safe audit gives positive joint reveal rate to every coordinate in a finite library-covered target set, including public-null deviations. With $10^6$ hands, SAD raises the river over-fold certified gain from $0.485$ to $0.692$ and improves both gains over public-only collection on all three deviations (Holm-adjusted paired $p\le0.012$), while selecting no control target. On a fixed-board public twin, a disjoint audit-refit-deploy loop detects all $30$ simulation seeds and no control seed, certifying absolute value $0.655$ (95% confidence-interval half-width $0.008$). Every floor-constrained probe and response passes a floor audit. Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-12 in cs.GT). Categorie arXiv: Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2608.09954 — 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-19T06:10:07.742Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).