Pré-Publication, Document De Travail Année : 2023

Synthesising Full-Information Protocols

Résumé

We lay out a model of games with imperfect information that features explicit communication actions, by which the entire observation history of a player is revealed to another player. Such full-information protocols are common in asynchronous distributed systems; here, we consider a synchronous setting with a single active player who may communicate with multiple passive observers in an indeterminate environment. We present a procedure for solving the basic strategy-synthesis problem under regular winning conditions. We present our solution in an abstract framework of games with imperfect information and we split the proof in two conceptual parts: (i) a generic reduction schema from imperfect-information to perfect-information games, and (ii) a specific construction for full-information protocols that satisfies the requirement of the reduction schema.

Dates et versions

hal-04310707 , version 1 (27-11-2023)

Identifiants

Citer

Dietmar Berwanger, Laurent Doyen, Thomas Soullard. Synthesising Full-Information Protocols. 2023. ⟨hal-04310707⟩
73 Consultations
0 Téléchargements

Altmetric

Partager

  • More