で、Alan D. Taylor さんの2つの論文のPDFリンク切れているから、検索し直した 下記、ご参照
1) http://www.cs.umd.edu/~gasarch/ William Gasarch Professor of Computer Science Affiliate of Mathematics University of Maryland at College Park
http://www.cs.umd.edu/~gasarch/TOPICS/hats/hats.html Papers on Hat Problems I want to read by William Gasarch
21. An Introduction to Infinite Hat Problems by Christopher Hardin and Alan Taylor. HAT GAME- infinite number of people, need to get all but a finite number of them right. Needs AC. Infinite Hats and AC
http://www.cs.umd.edu/~gasarch/TOPICS/hats/infinite-hats-and-ac.pdf An Introduction to Infinite Hat Problems Chris Hardin and Alan Taylor THE MATHEMATICAL INTELLIGENCER 2008 Springer Science+Business Media, Inc
Alan Dana Taylor (born October 27, 1947) is an American mathematician who, with Steven Brams, solved the problem of envy-free cake-cutting for an arbitrary number of people with the Brams?Taylor procedure.
Taylor received his Ph.D. in 1975 from Dartmouth College.[2]
He currently is the Marie Louise Bailey professor of mathematics at Union College, in Schenectady, New York.