Card guessing and the birthday problem for sampling without replacement
From MaRDI portal
Publication:6180369
DOI10.1214/23-aap1946arXiv2108.07355OpenAlexW4389674530MaRDI QIDQ6180369
Publication date: 19 January 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.07355
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics
- Exchangeable pairs and Poisson approximation
- Lattice paths, sampling without replacement, and limiting distributions
- Two moments suffice for Poisson approximations: The Chen-Stein method
- The analysis of sequential experiments with feedback to subjects
- A note on Blackwell and Hodges (1957) and Diaconis and Graham (1981)
- Poisson approximation for dependent trials
- No-feedback card guessing for dovetail shuffles
- Size biased couplings and the spectral gap for random regular graphs
- Size bias for one and all
- Online card games
- On card guessing game with one time riffle shuffle and complete feedback
- The card guessing game: a generating function approach
- Design for the Control of Selection Bias
- Sequential urn schemes and birth processes
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- The general birthday problem
- Guessing about Guessing: Practical Strategies for Card Guessing with Feedback
- Forcing a sequential experiment to be balanced
- Card guessing with partial feedback
- A simple card guessing game revisited
