• Corpus ID: 237142651

# Card guessing and the birthday problem for sampling without replacement

```@inproceedings{He2021CardGA,
title={Card guessing and the birthday problem for sampling without replacement},
author={Jimmy He and Andrea Ottolini},
year={2021}
}```
• Published 16 August 2021
• Mathematics
Consider a uniformly random deck consisting of cards labelled by numbers from 1 through n, possibly with repeats. A guesser guesses the top card, after which it is revealed and removed and the game continues. What is the expected number of correct guesses under the best and worst strategies? We establish sharp asymptotics for both strategies. For the worst case, this answers a recent question of Diaconis, Graham, He and Spiro, who found the correct order [12]. As part of the proof, we study the…
1 Citations

## Figures and Tables from this paper

Online card games
• Sam Spiro
• Mathematics, Computer Science
Electronic Journal of Probability
• 2022
It is proved that a certain greedy strategy for the shuffler is the unique optimal strategy in this game, and that the guesser can achieve at most log n expected correct guesses asymptotically for fixed m against this greedy strategy.

## References

SHOWING 1-10 OF 36 REFERENCES
The Card Guessing Game: A generating function approach
• Mathematics
• 2021
Consider a card guessing game with complete feedback in which a deck of n cards ordered 1, . . . , n is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses
Online Card Games
It is proved that a certain greedy strategy for the shuffler is the unique optimal strategy in this game, and that the guesser can achieve at most log n expected correct guesses asymptotically for fixed m against this greedy strategy.
No-feedback card guessing for dovetail shuffles
It is shown that for k 2 log 2 (2n) + 1 the best strategy is to guess card 1 for the rst half of the deck and card 2n for the second half, indicating that the deck must be given k dovetail shuues to obtain a well mixed deck.
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback
• Computer Science
• 2020
This work studies problems where feedback is given after each guess and shows that simple heuristics perform close to optimal in simple card games.
A Simple Card Guessing Game Revisited
• Computer Science
Electron. J. Comb.
• 2001
The expected number of correct guesses with this strategy, as well as the probability of beating an opponent who uses the naive stategy of random guessing, are determined.
The Analysis of Sequential Experiments with Feedback to Subjects
• Computer Science
• 1981
This work determines the optimal and worst case strategies for subjects and the distribution of the number of correct guesses under these strategies and shows how to use skill scoring to evaluate experiments in a way which (asymptotically) does not depend on the subject's strategy.
On Birthday, Collectors', Occupancy and Other Classical Urn Problems
Summary An urn contains r different balls. Balls are drawn with replacement until any k balls have been obtained at least m times each. How many draws are necessary? How many balls have been drawn
Size bias for one and all
• Mathematics
Probability Surveys
• 2019
Size bias occurs famously in waiting-time paradoxes, undesirably in sampling schemes, and unexpectedly in connection with Stein's method, tightness, analysis of the lognormal distribution, Skorohod
Exchangeable pairs and Poisson approximation
• Mathematics
• 2005
This is a survery paper on Poisson approximation using Stein's method of exchangeable pairs. We illustrate using Poisson-binomial trials and many variations on three classical problems of
A bound for the error in the normal approximation to the distribution of a sum of dependent random variables
This paper has two aims, one fairly concrete and the other more abstract. In Section 3, bounds are obtained under certain conditions for the departure of the distribution of the sum of n terms of a