>>666
すなおでよろしい

Theorem 2.5. Weak Gabay-O'Connor Theorem
Regardless of what the set A of agents is and what the collections Ka are (provided |Ka|>=2), there is a strategy ensuring that for every assignment of colored hats, only finitely many agents guess correctly.

Choice of Choice: Paradoxical Results Surrounding of the Axiom of Choice
Connor Hurley