We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

New constructions and bounds for Winkler's hat game.

Gadouleau, Maximilien and Georgiou, Nicholas (2015) 'New constructions and bounds for Winkler's hat game.', SIAM journal on discrete mathematics., 29 (2). pp. 823-834.


Hat problems have recently become a popular topic in combinatorics and discrete mathematics. These have been shown to be strongly related to coding theory, network coding, and auctions. We consider the following version of the hat game, introduced by Winkler and studied by Butler et al. A team is composed of several players; each player is assigned a hat of a given color; they do not see their own color but can see some other hats, according to a directed graph. The team wins if they have a strategy such that, for any possible assignment of colors to their hats, at least one player guesses their own hat color correctly. In this paper, we discover some new classes of graphs which allow a winning strategy, thus answering some of the open questions of Butler et al. We also derive upper bounds on the maximal number of possible hat colors that allow for a winning strategy for a given graph.

Item Type:Article
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Publisher statement:Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Date accepted:26 January 2015
Date deposited:29 April 2015
Date of first online publication:21 April 2015
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar