Central limit theorem in complete feedback games

DOI10.1017/JPR.2023.64MaRDI QIDQ6431051zbMATH OpenOpenAlexFDO

Authors Andrea Ottolini, Raghavendra Tripathi

Publication date 27 March 2023

Full work available at URL https://doi.org/10.1017/jpr.2023.64

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Central limit and other weak theorems (60F05) Probabilistic games; gambling (91A60)

Abstract: Consider a well-shuffled deck of cards of $n$ different types where each type occurs $m$ times. In a complete feedback game, a player is asked to guess the top card from the deck. After each guess, the top card is revealed to the player and is removed from the deck. The total number of correct guesses in a complete feedback game has attracted significant interest in last few decades. Under different regimes of $m,n$, the expected number of correct guesses, under the greedy (optimal) strategy, has been obtained by various authors, while there are not many results available about the fluctuations. In this paper, we establish a central limit theorem with Berry-Esseen bounds when $m$ is fixed and $n$ is large. Our results extend to the case of decks where different types may have different multiplicity, under suitable assumptions.

Recommendations

• Card guessing with partial feedback
• On card guessing games: limit law for no feedback one-time riffle shuffle
• Moments of the one-shuffle no-feedback card guessing game
• On card guessing game with one time riffle shuffle and complete feedback
• The card guessing game: a generating function approach

This page was built for publication: Central limit theorem in complete feedback games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431051)