Paper Info
Title
The hat problem on cycles on at least nine vertices.
Abstract
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 on a graph is known for trees and for the cycle C-4. We solve the problem on cycles on at least nine vertices.
Year
Venue
Keywords
2011
ARS COMBINATORIA
hat problem,graph,cycle
Field
DocType
Volume
Discrete mathematics,Combinatorics,Vertex (geometry),Mathematics
Journal
101
ISSN
Citations 
PageRank 
0381-7032
1
0.48
References 
Authors
0
1
Name
Order
Citations
PageRank
Marcin Krzywkowski1166.22