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.FSTTCS.2015.307
URN: urn:nbn:de:0030-drops-56575
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5657/
Berwanger, Dietmar ;
van den Bogaard, Marie
Games with Delays - A Frankenstein Approach
Abstract
We investigate infinite games on finite graphs where the information flow is perturbed by non- deterministic signalling delays. It is known that such perturbations make synthesis problems virtually unsolvable, in the general case. On the classical model where signals are attached to states, tractable cases are rare and difficult to identify.
In this paper, we propose a model where signals are detached from control states, and we identify a subclass on which equilibrium outcomes can be preserved, even if signals are delivered with a delay that is finitely bounded. To offset the perturbation, our solution procedure combines responses from a collection of virtual plays following an equilibrium strategy in the instant- signalling game to synthesise, in a Dr. Frankenstein manner, an equivalent equilibrium strategy for the delayed-signalling game.
BibTeX - Entry
@InProceedings{berwanger_et_al:LIPIcs:2015:5657,
author = {Dietmar Berwanger and Marie van den Bogaard},
title = {{Games with Delays - A Frankenstein Approach}},
booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
pages = {307--319},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-97-2},
ISSN = {1868-8969},
year = {2015},
volume = {45},
editor = {Prahladh Harsha and G. Ramalingam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5657},
URN = {urn:nbn:de:0030-drops-56575},
doi = {10.4230/LIPIcs.FSTTCS.2015.307},
annote = {Keywords: infinite games on graphs, imperfect information, delayed monitoring, distributed synthesis}
}
Keywords: |
|
infinite games on graphs, imperfect information, delayed monitoring, distributed synthesis |
Collection: |
|
35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
14.12.2015 |