Three problems for the clairvoyant demon
classification
🧮 math.PR
keywords
problemsclairvoyantdemonthreeachievedcoincommondependent
read the original abstract
A number of tricky problems in probability are discussed, having in common one or more infinite sequences of coin tosses, and a representation as a problem in dependent percolation. Three of these problems are of `Winkler' type, that is, they ask about what can be achieved by a clairvoyant demon.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.