当前位置:
X-MOL 学术
›
Math. Logic Q.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Strategic equivalence among hat puzzles of various protocols with many colors
Mathematical Logic Quarterly ( IF 0.4 ) Pub Date : 2020-09-15 , DOI: 10.1002/malq.201900069 Masaru Kada 1 , Souji Shizuma 1
Mathematical Logic Quarterly ( IF 0.4 ) Pub Date : 2020-09-15 , DOI: 10.1002/malq.201900069 Masaru Kada 1 , Souji Shizuma 1
Affiliation
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.
中文翻译:
具有多种颜色的各种协议的帽子拼图之间的战略对等
我们用无限多的囚犯和两种以上的帽子颜色来讨论“囚犯和帽子的谜题”。假设这组帽子颜色配备了可交换的群结构,我们证明了具有可数众多囚犯的几个协议的谜题之间的战略等效性。
更新日期:2020-09-15
中文翻译:
具有多种颜色的各种协议的帽子拼图之间的战略对等
我们用无限多的囚犯和两种以上的帽子颜色来讨论“囚犯和帽子的谜题”。假设这组帽子颜色配备了可交换的群结构,我们证明了具有可数众多囚犯的几个协议的谜题之间的战略等效性。