---
res:
bibo_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.\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@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Kristoffer Arnsfelt
foaf_name: Hansen, Kristoffer Arnsfelt
foaf_surname: Hansen
- foaf_Person:
foaf_givenName: Rasmus
foaf_name: Ibsen-Jensen, Rasmus
foaf_surname: Ibsen-Jensen
foaf_workInfoHomepage: http://www.librecat.org/personId=3B699956-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0003-4783-0389
- foaf_Person:
foaf_givenName: Abraham
foaf_name: Neyman, Abraham
foaf_surname: Neyman
bibo_doi: 10.1145/3219166.3219198
dct_date: 2018^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/9781450358293
dct_language: eng
dct_publisher: ACM Press@
dct_title: The Big Match with a clock and a bit of memory@
...