Lower Bound for the Communication Complexity of the Russian Cards Problem

In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement. Since DEL is a general model for any public announcement scheme we conclude that there exist no single announcement solutio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Cyriac, Aiswarya, Krishnan, K. Murali
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!