Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Union

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The hat problem on a union of disjoint graphs

100%

Krzywkowski M.

Commentationes Mathematicae

2011

tom 51

nr 2

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.

Ograniczanie wyników

1 Commentationes Mathematicae

1 Krzywkowski M.

1 2011

Wyniki wyszukiwania

The hat problem on a union of disjoint graphs