Abstrakt
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 simultaneously 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 give a comprehensive list of variations considered in the literature. We describe the applications of the hat problem and its variations, and their connections to different areas of science. We give the full bibliography of any papers, books, and electronic publications about the hat problem.
Autor (1)
Cytuj jako
Pełna treść
- Wersja publikacji
- Accepted albo Published Version
- Licencja
- otwiera się w nowej karcie
Słowa kluczowe
Informacje szczegółowe
- Kategoria:
- Publikacja w czasopiśmie
- Typ:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Opublikowano w:
-
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica
nr 9,
strony 55 - 67,
ISSN: 2081-545X - Język:
- angielski
- Rok wydania:
- 2010
- Opis bibliograficzny:
- Krzywkowski M.: On the hat problem, its variations, and their applications// Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica. -Vol. 9., (2010), s.55-67
- Weryfikacja:
- Politechnika Gdańska
wyświetlono 91 razy