License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.387
URN: urn:nbn:de:0030-drops-33354
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3335/
Go to the corresponding LIPIcs Volume Portal

Berwanger, Dietmar ; Kaiser, Lukasz ; Puchala, Bernd

A Perfect-Information Construction for Coordination in Games

pdf-format:
17.pdf (0.4 MB)

Abstract

We present a general construction for eliminating imperfect information from games with several players who coordinate against nature, and to transform them into two-player games with perfect information while preserving winning strategy profiles. The construction yields an infinite game tree with epistemic models associated to nodes. To obtain a more succinct representation,
we define an abstraction based on homomorphic equivalence, which we prove to be sound for games with observable winning conditions. The abstraction generates finite game graphs in several relevant cases, and leads to a new semi-decision procedure for multi-player games with imperfect information.

BibTeX - Entry

@InProceedings{berwanger_et_al:LIPIcs:2011:3335,
  author =	{Dietmar Berwanger and Lukasz Kaiser and Bernd Puchala},
  title =	{{A Perfect-Information Construction for Coordination in Games}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{387--398},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Supratik Chakraborty and Amit Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3335},
  URN =		{urn:nbn:de:0030-drops-33354},
  doi =		{10.4230/LIPIcs.FSTTCS.2011.387},
  annote =	{Keywords: Distributed Synthesis, Games on Graphs, Imperfect Information, Epistemic Models}
}

Keywords: Distributed Synthesis, Games on Graphs, Imperfect Information, Epistemic Models
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Issue Date: 2011
Date of publication: 01.12.2011

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