Open Access
Translator Disclaimer
September, 1974 On Two-Move Prediction Games
Kang Ling
Ann. Statist. 2(5): 988-999 (September, 1974). DOI: 10.1214/aos/1176342819


The following class of games is considered: a sequence chooser produces an infinite sequence of 0's and 1's, and a predictor observes the sequence for a finite time, stopping when he pleases and choosing an action from a finite set. The predictor wins an amount depending only on the action chosen and on the first two unobserved terms of the sequence. The value of such games is determined and the formula obtained is used to give a derivation of the well-known values of the 1-0 game and the two-move lag bomber-battleship game. Values for some generalizations of the latter game are given. Optimal strategies for the sequence chooser are discussed.


Download Citation

Kang Ling. "On Two-Move Prediction Games." Ann. Statist. 2 (5) 988 - 999, September, 1974.


Published: September, 1974
First available in Project Euclid: 12 April 2007

zbMATH: 0291.90077
MathSciNet: MR384179
Digital Object Identifier: 10.1214/aos/1176342819

Primary: 90D05
Secondary: 90D45

Keywords: $1, 0$ game , bomber-battleship game , optimal strategies , Value of two-move prediction games

Rights: Copyright © 1974 Institute of Mathematical Statistics


Vol.2 • No. 5 • September, 1974
Back to Top