2 citations · 2 across the 3 of their papers we have counts for
4 papers
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,…
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…
Infinite games with finite knowledge gaps
Dietmar Berwanger, Anup Basil Mathew
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players…
Games with recurring certainty
Dietmar Berwanger, Anup Basil Mathew
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of und…