The Mathematics of Coordinated Inference pp 61-69 | Cite as

# Galvin’s Setting: Neutral and Anonymous Predictors

Chapter

First Online:

## Abstract

The context originally studied by Galvin in the 1960s involved predictors for *ω* where (roughly speaking) the agents did not know where in line they were standing. This leads naturally to *anonymous* predictors, which must obey a certain symmetry with respect to agents. We also consider *neutral* predictors, which must obey a kind of symmetry with respect to colors (in the sense that any permutation of the set of colors must result in agents’ guesses being likewise permuted).

## Bibliography

- [EH66]Erdős, P., Hajnal, A.: On a problem of B. Jonsson. Bull. Acad. Polon. Sci. Ser. Math. Astron. Phys.
**14**, 19–23 (1966)Google Scholar - [Gal65]Galvin, F.: Problem 5348. Am. Math. Mon.
**72**, 1136 (1965)MathSciNetGoogle Scholar - [GP76]Galvin, F., Prikry, K.: Infinitary Jonsson algebras and partition relations. Algebra Univ.
**6**(3), 367–376 (1976)MathSciNetCrossRefzbMATHGoogle Scholar - [Hen59]Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, pp. 167–183 (1959)Google Scholar
- [Kun71]Kunen, K.: Elementary embeddings and infinitary combinatorics. J. Symb. Logic
**36**, 407–413 (1971)MathSciNetCrossRefzbMATHGoogle Scholar - [Mal66]Malitz, J.: Problems in the model theory of infinite languages. PhD thesis, University of California, Berkeley (1966)Google Scholar
- [Sil66]Silverman, D.L.: Solution of problem 5348. Am. Math. Mon.
**73**, 1131–1132 (1966)CrossRefGoogle Scholar - [Tho67]Thorp, B.L.D.: Solution of problem 5348. Am. Math. Mon.
**74**, 730–731 (1967)MathSciNetCrossRefGoogle Scholar - [Yip94]Yiparaki, O.: On some tree partitions. PhD thesis, University of Michigan (1994)Google Scholar

## Copyright information

© Springer International Publishing Switzerland 2013