Planar Graphs of Odd-Girth at Least $9$ are Homomorphic to the Petersen Graph
Let $G$ be a graph and let $c: V(G)\to\binom{1,\ldots,5}{2}$ be an assignment of $2$-element subsets of the set $1,\ldots,5$ to the vertices of $G$ such that for every edge $vw$, the sets $c(v)$ and ...
Let $G$ be a graph and let $c: V(G)\to\binom{1,\ldots,5}{2}$ be an assignment of $2$-element subsets of the set $1,\ldots,5$ to the vertices of $G$ such that for every edge $vw$, the sets $c(v)$ and ...
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in ...
The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in ...
You are not logged in to this journal. Log in
Hat Guessing Games
SIAM J. Discrete Math. Volume 22, Issue 2, pp. 592-605 (2008)
Published March 21, 2008
Connotea
CiteULike
del.icio.us
BibSonomy
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of $n$ players tries to guess the color of the hat he or she is wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the objective is to maximize the number of correct answers in the worst case. We also summarize what is currently known about the worst-case analysis of deterministic hat guessing problems with a finite number of players.
©2008 Society for Industrial and Applied Mathematics| History: | Received February 22, 2006; accepted September 23, 2007; published March 21, 2008 |
| Permalink: | http://dx.doi.org/10.1137/060652774 |
KEYWORDS and AMS
91A12, 05C20
PUBLICATION DATA
0895-4801 (print)
1095-7146 (online)
SIAM