@inproceedings{5967, abstract = {The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage. Blackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient. }, author = {Hansen, Kristoffer Arnsfelt and Ibsen-Jensen, Rasmus and Neyman, Abraham}, booktitle = {Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18}, isbn = {9781450358293}, location = {Ithaca, NY, United States}, pages = {149--150}, publisher = {ACM Press}, title = {{The Big Match with a clock and a bit of memory}}, doi = {10.1145/3219166.3219198}, year = {2018}, }