Three steps

Authors:
Hans van Ditmarsch;Fernando Soler-Toscano
Affiliations:
University of Sevilla, Spain;University of Sevilla, Spain
Venue:
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Year:
2011

Citing 7
Cited 0

Reasoning about knowledge

Reasoning about knowledge
Computations with a deck of cards

Theoretical Computer Science
The logic of public announcements, common knowledge, and private suspicions

TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
A Knowledge Based Semantics of Messages

Journal of Logic, Language and Information
Combinatorial Designs: Constructions and Analysis

Combinatorial Designs: Constructions and Analysis
Solving Sum and Product Riddle via BDD-Based Model Checking

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Model Checking Russian Cards

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given is a deal of ten cards over three players, such that two players each get four cards and the remaining player (the 'eavesdropper') two cards. We show that there does not exist a protocol of two steps for the four-card players to inform each other safely of their hands of cards, and we then present a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.