Online card games (Q2136089): Difference between revisions

For the one player game, a deck containing \(m\) copies of \(n\) different card types is shuffled uniformly at random. Each round the player tries to guess the next card in the deck, and then the card is revealed and discarded. It is known that if \(m\) is fixed, then the maximum expected number of correct guesses that the player can achieve is asymptotic to \(H_m \log n\). This paper considers an adversarial version of this one player game, where a second player shuffles the deck according to some (possibly non-uniform) distribution. The author proves 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.