New Constructions and Bounds for Winkler's Hat Game

DOI10.1137/130944680zbMath1388.91076arXiv1311.2022OpenAlexW2963182345MaRDI QIDQ5254032

Nicholas Georgiou, Maximilien Gadouleau

Publication date: 8 June 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.2022

zbMATH Keywords

directed graphshat gamedeterministic strategies

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Directed graphs (digraphs), tournaments (05C20) Combinatorial games (91A46)

Related Items (14)

The Hats game. On maximum degree and diameter ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Bears with hats and independence polynomials ⋮ On the hat guessing number of a planar graph class ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ Hat guessing number for the class of planar graphs is at least 22 ⋮ Hat guessing numbers of degenerate graphs ⋮ Cliques and constructors in ``Hats game. I ⋮ Cliques and constructors in ``Hats game. II ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Hat guessing on books and windmills ⋮ On the hat guessing number of graphs ⋮ The hat guessing number of graphs ⋮ Hat problem: a new strategy based on quantum stabilizer codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remoteness of permutation codes
• Information flows, graphs and their guessing numbers
• On the hat problem on a graph
• On the Autoreducibility of Random Sequences
• Network information flow
• Hats, auctions and derandomization
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Digraphs
• Derandomization of auctions
• Hat Guessing Games

This page was built for publication: New Constructions and Bounds for Winkler's Hat Game