Games of infinite length and perfect information have been studied for many years. There are numerous determinacy results for these games, and there is a wide body of work on consequences of their determinacy.
Except for games with very special payoff functions, games of infinite length and imperfect information have been little studied. In 1969, David Blackwell  introduced a class of such games and proved a determinacy theorem for a subclass. During the intervening time, there has not been much progress in proving the determinacy of Blackwell's games. Orkin  extended Blackwell's result to a slightly wider class. Blackwell  found a new proof of his own result. Maitra and Sudderth [9, 10] improved Blackwell's result in a different direction from that of Orkin and also generalized to the case of stochastic games. Recently Vervoort  has obtained a substantial improvement. Nevertheless, almost all the basic questions have remained open.
In this paper we associate with each Blackwell game a family of perfect information games, and we show that the (mixed strategy) determinacy of the former follows from the (pure strategy) determinacy of the latter. The complexity of the payoff function for the Blackwell game is approximately the same as the complexity of the payoff sets for the perfect information games. In particular, this means that the determinacy of Blackwell games with Borel measurable payoff functions follows from the known determinacy of perfect information games with Borel payoff sets.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 28th June 2017. This data will be updated every 24 hours.