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 an observation process driven by a sequential Mealy machine. In contrast, the second approach features indistinguishability relations described by synchronous two-tape automata. The indistinguishability-relation model turns out to be strictly more expressive than the one based on observations. We present a characterisation of the indistinguishability relations that admit a...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.