2010/06/07 by Lerna Pehlivan, Pehlivan, Lerna
Computer Science · #Algorithms and Data Compression #Data Management and Algorithms #FOS: Mathematics #Machine Learning and Algorithms #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.1006.1321
openalex publication_date 2010/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Consider n cards that are labeled 1 through n with n an even integer. The cards are put face down and their ordering starts with card labeled 1 on top through card labeled n at the bottom. The cards are top to random shuffled m times and placed face down on the table. Starting from the top the cards are guessed without feedback (i.e. whether the guess was correct or false and what the guessed card was) one at a time. For m > 4nlog n+cn we find a guessing strategy that maximizes the expected number of correct guesses.