On Optimal Strategies for a Hat Game on Graphs


The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupies a different vertex of a graph. Either blue or red hats are placed randomly and independently on their heads. Each player sees the colors of the hats of players in neighboring vertices and… (More)
DOI: 10.1137/090778791


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics