## The Annals of Probability

### Borel Sets Via Games

D. Blackwell

#### Abstract

A family of games $G = G(\sigma, u)$ is defined such that (a) for each $\sigma$ the set of all $u$ for which Player I can force a win in $G(\sigma, u)$ is a Borel set $B(u)$ and (b) every Borel set is a $B(u)$ for some $u$.

#### Article information

Source
Ann. Probab., Volume 9, Number 2 (1981), 321-322.

Dates
First available in Project Euclid: 19 April 2007

https://projecteuclid.org/euclid.aop/1176994474

Digital Object Identifier
doi:10.1214/aop/1176994474

Mathematical Reviews number (MathSciNet)
MR606995

Zentralblatt MATH identifier
0455.28002

JSTOR