arXiv (All)
open access
Extremal expectations in card guessing with partial feedback: proofs of two conjectures of Diaconis-Graham-Spiro
We study the minimum and maximum expected scores over all adaptive strategies in sequential card guessing with yes/no feedback. A deck contains $n$ labels, each appearing $m$ times, and is shuffled uniformly. The cards are guessed one at a time, and after each guess the player is told only whether i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- Minimax Last-Iterate Convergence in Matrix Games with Observed Actions#1128916
- The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback#31273
- Multiple ergodic averages for commuting multiplicative actions#819853
Record · ID 1051555
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive