License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2020.48
URN: urn:nbn:de:0030-drops-119095
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11909/
Go to the corresponding LIPIcs Volume Portal

Berwanger, Dietmar ; Doyen, Laurent

Observation and Distinction. Representing Information in Infinite Games

pdf-format:
LIPIcs-STACS-2020-48.pdf (0.5 MB)

Abstract

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 representation as a finite-state observation function. We show that the characterisation is decidable, and give a procedure to construct a corresponding Mealy machine whenever one exists.

BibTeX - Entry

@InProceedings{berwanger_et_al:LIPIcs:2020:11909,
  author =	{Dietmar Berwanger and Laurent Doyen},
  title =	{{Observation and Distinction. Representing Information in Infinite Games}},
  booktitle =	{37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
  pages =	{48:1--48:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-140-5},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{154},
  editor =	{Christophe Paul and Markus Bl{\"a}ser},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11909},
  URN =		{urn:nbn:de:0030-drops-119095},
  doi =		{10.4230/LIPIcs.STACS.2020.48},
  annote =	{Keywords: Infinite Games on Finite Graphs, Imperfect Information, Automatic Structures}
}

Keywords: Infinite Games on Finite Graphs, Imperfect Information, Automatic Structures
Collection: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Issue Date: 2020
Date of publication: 04.03.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI