Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Consider the following game. There are n players, each wearing a hat colored red or blue. Each player does not see the color of her own hat but does see the colors of all other hats. Simultaneously, each player has to guess the color of her own hat, without communicating with the other players. The players are allowed to meet beforehand, hats-off, in order to coordinate a strategy. We give an explicit polynomial time deterministic strategy which guarantees that the number of correct guesses is at least max{nr, nb}-O(n1/2), where nr is the number of players with a red hat and nb = n - nr. This answers a question of Feige.