- Tytuł:
- The hat problem on a union of disjoint graphs
- Autorzy:
- Krzywkowski, Marcin
- Powiązania:
- https://bibliotekanauki.pl/articles/744858.pdf
- Data publikacji:
- 2011
- Wydawca:
- Polskie Towarzystwo Matematyczne
- Tematy:
-
Hat problem
Graph
Disjoint
Union - Opis:
- 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.
- Źródło:
-
Commentationes Mathematicae; 2011, 51, 2
0373-8299 - Pojawia się w:
- Commentationes Mathematicae
- Dostawca treści:
- Biblioteka Nauki
Artykuł