5 citations · 7 across the 6 of their papers we have counts for
10 papers
Synthesising Full-Information Protocols
Dietmar Berwanger, Laurent Doyen, Thomas Soullard
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 play…
Observation and Distinction. Representing Information in Infinite Games
Dietmar Berwanger, Laurent Doyen
We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of…
Deviator Detection under Imperfect Monitoring
Dietmar Berwanger, R. Ramanujam
Grim-trigger strategies are a fundamental mechanism for sustaining equilibria in iterated games: the players cooperate along an agreed path, and as soon as one player deviates, the…
A Retraction Theorem for Distributed Synthesis
Dietmar Berwanger, Anup Basil Mathew, R. Ramanujam
We present a general theorem for distributed synthesis problems in coordination games with -regular objectives of the form: If there exists a winning strategy for the coalition,…
Games with Delays. A Frankenstein Approach
Dietmar Berwanger, Marie van den Bogaard
We investigate infinite games on finite graphs where the information flow is perturbed by nondeterministic signalling delays. It is known that such perturbations make synthesis pro…
Hierarchical Information and the Synthesis of Distributed Strategies
Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard
Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a tota…