The hat problem on a union of disjoint graphs

• Autorzy: Marcin Krzywkowski
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

Hat problem; Graph; Disjoint; Union

• Wydawca: Polish Mathematical Society
• Czasopismo: Commentationes Mathematicae
• Rocznik: 2011
• Tom: 51
• Numer: 2

Daty

wydano

2011

online

2017-12-19

Twórcy

autor

Marcin Krzywkowski

Identyfikatory

DOI

10.14708/cm.v51i2.5318