Strategic equivalence among hat puzzles of various protocols with many colors

Strategic equivalence among hat puzzles of various protocols with many colors

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical logic quarterly 2020-10, Vol.66 (3), p.295-299
Hauptverfasser: Kada, Masaru, Shizuma, Souji
Format: Artikel
Sprache:eng
Schlagworte:
Equivalence
Prisoners
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0942-5616
1521-3870
DOI:10.1002/malq.201900069