A modified hat problem

Marcin Krzywkowski. "A modified hat problem." Commentationes Mathematicae 50.2 (2010): null. <http://eudml.org/doc/291567>.

@article{MarcinKrzywkowski2010,
abstract = {The topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultane- ously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many variations of the hat problem. In this paper we consi- der a variation in which there are $n\ge 3$ players, and blue and red hats. Players do not have to guess their hat colors simultaneously. In this variation of the hat problem players guess their hat colors by coming to the basket and throwing the proper card into it. Every player has got two cards with his name and the sentence “I have got a red hat” or “I have got a blue hat”. If someone wants to resign from answering, then he does not do anything. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. Is there a strategy such that the team always succeeds? We give an optimal strategy for the problem which always succeeds. Additionally, we prove in which step the team wins using the strategy. We also prove what is the greatest possible number of steps that are needed for the team to win using the strategy.},
author = {Marcin Krzywkowski},
journal = {Commentationes Mathematicae},
keywords = {hat problem; variation of hat problem},
language = {eng},
number = {2},
pages = {null},
title = {A modified hat problem},
url = {http://eudml.org/doc/291567},
volume = {50},
year = {2010},
}

TY - JOUR
AU - Marcin Krzywkowski
TI - A modified hat problem
JO - Commentationes Mathematicae
PY - 2010
VL - 50
IS - 2
SP - null
AB - The topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultane- ously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many variations of the hat problem. In this paper we consi- der a variation in which there are $n\ge 3$ players, and blue and red hats. Players do not have to guess their hat colors simultaneously. In this variation of the hat problem players guess their hat colors by coming to the basket and throwing the proper card into it. Every player has got two cards with his name and the sentence “I have got a red hat” or “I have got a blue hat”. If someone wants to resign from answering, then he does not do anything. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. Is there a strategy such that the team always succeeds? We give an optimal strategy for the problem which always succeeds. Additionally, we prove in which step the team wins using the strategy. We also prove what is the greatest possible number of steps that are needed for the team to win using the strategy.
LA - eng
KW - hat problem; variation of hat problem
UR - http://eudml.org/doc/291567
ER -