Strategic equivalence among hat puzzles of various protocols with many colors
Logic
2019-11-11 v1
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.
Keywords
Cite
@article{arxiv.1911.03114,
title = {Strategic equivalence among hat puzzles of various protocols with many colors},
author = {Masaru Kada and Souji Shizuma},
journal= {arXiv preprint arXiv:1911.03114},
year = {2019}
}