Strategic equivalence among hat puzzles of various protocols with many colors

2019/11/08 by Masaru Kada, Kada, Masaru, Souji Shizuma +1
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Geometric and Algebraic Topology #Logic (math.LO)

paper · pdf · doi:10.48550/arxiv.1911.03114

openalex publication_date 2019/11/08 · openalex created_date 2019/11/22 · openalex updated_date 2026/07/28

Abstract

We discuss ``puzzles of prisoners and hats`` with infinitely many prisoners and more than two hat colors. Assuming that the set of hat colors is equipped with a commutative group structure, we prove strategic equivalence among puzzles of several protocols with countably many prisoners.

Related

• A note on the problem of prisoners and hats
• A General Theorem for Non-Simultaneous Hat Guessing Puzzles
• Too Many Hats
• New constructions and bounds for Winkler's hat game
• Cliques and constructors in "Hats'"game