{"month":"06","file":[{"date_created":"2019-11-19T08:24:24Z","date_updated":"2020-07-14T12:47:14Z","access_level":"open_access","creator":"dernst","file_size":302539,"relation":"main_file","file_name":"2018_EC18_Hansen.pdf","checksum":"bb52683e349cfd864f4769a8f38f2798","content_type":"application/pdf","file_id":"7054"}],"publication_status":"published","oa_version":"Submitted Version","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450358293"]},"year":"2018","date_updated":"2023-09-19T10:45:15Z","conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","location":"Ithaca, NY, United States","start_date":"2018-06-18"},"date_created":"2019-02-13T10:31:41Z","department":[{"_id":"KrCh"}],"author":[{"last_name":"Hansen","full_name":"Hansen, Kristoffer Arnsfelt","first_name":"Kristoffer Arnsfelt"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"},{"full_name":"Neyman, Abraham","last_name":"Neyman","first_name":"Abraham"}],"publication":"Proceedings of the 2018 ACM Conference on Economics and Computation  - EC '18","page":"149-150","_id":"5967","status":"public","article_processing_charge":"No","citation":{"ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. EC: Conference on Economics and Computation, 149–150.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150.","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, ACM Press, 2018, pp. 149–50, doi:<a href=\"https://doi.org/10.1145/3219166.3219198\">10.1145/3219166.3219198</a>.","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, Ithaca, NY, United States, 2018, pp. 149–150.","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>. ACM Press; 2018:149-150. doi:<a href=\"https://doi.org/10.1145/3219166.3219198\">10.1145/3219166.3219198</a>","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i>, 149–50. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3219166.3219198\">https://doi.org/10.1145/3219166.3219198</a>.","apa":"Hansen, K. A., Ibsen-Jensen, R., &#38; Neyman, A. (2018). The Big Match with a clock and a bit of memory. In <i>Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18</i> (pp. 149–150). Ithaca, NY, United States: ACM Press. <a href=\"https://doi.org/10.1145/3219166.3219198\">https://doi.org/10.1145/3219166.3219198</a>"},"doi":"10.1145/3219166.3219198","external_id":{"isi":["000492755100020"]},"date_published":"2018-06-18T00:00:00Z","quality_controlled":"1","ddc":["000"],"oa":1,"title":"The Big Match with a clock and a bit of memory","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file_date_updated":"2020-07-14T12:47:14Z","publisher":"ACM Press","day":"18","has_accepted_license":"1","isi":1,"abstract":[{"lang":"eng","text":"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.\r\nBlackwell 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.\r\n"}]}