Wyszukiwarka
Abstrakt
The topic 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 winning. In this version every player can see everybody excluding himself. We consider such a problem on a graph, where vertices correspond to players, and a player can see each player to whom he is connected by an edge. The solution of the hat problem is known for cycles and bipartite graphs. We investigate the problem on a union of disjoint graphs.
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:
-
Commentationes Mathematicae
nr 51,
strony 167 - 176,
ISSN: 0373-8299 - Język:
- angielski
- Rok wydania:
- 2011
- Opis bibliograficzny:
- Krzywkowski M.: The hat problem on a union of disjoint graphs// Commentationes Mathematicae. -Vol. 51., iss. Iss. 2 (2011), s.167-176
- Weryfikacja:
- Politechnika Gdańska
wyświetlono 86 razy