By Topic

On hats and other covers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. W. Jr. Lenstra ; California Univ., Berkeley, CA, USA ; G. Seroussi

The following game puzzle has recently received attention from mathematicians, computer scientists, coding theorists, and even from the mass press: A team of n players is fitted with hats, which are either red or green. A player can see the other players' hat colors, but not his own. Each player is then asked to declare his hat color, or pass. All the players must declare simultaneously, with no inter-player communication allowed during the game. They are permitted, however, to hold a strategy coordination meeting before the game starts. The team wins if at least one player declares the correct color, and no player declares incorrectly. The goal of the team is to devise a strategy that maximizes the winning probability, under an assumption of uniform probability distribution on the hat color combinations.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002