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.CONCUR.2017.2
URN: urn:nbn:de:0030-drops-78066
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7806/
Brenguier, Romain ;
Pauly, Arno ;
Raskin, Jean-François ;
Sankur, Ocan
Admissibility in Games with Imperfect Information (Invited Talk)
Abstract
In this invited paper, we study the concept of admissible strategies for two player win/lose infinite sequential games with imperfect information. We show that in stark contrast with the perfect information variant, admissible strategies are only guaranteed to exist when players have objectives that are closed sets. As a consequence, we also study decision problems related to the existence of admissible strategies for regular games as well as finite duration games.
BibTeX - Entry
@InProceedings{brenguier_et_al:LIPIcs:2017:7806,
author = {Romain Brenguier and Arno Pauly and Jean-Fran{\c{c}}ois Raskin and Ocan Sankur},
title = {{Admissibility in Games with Imperfect Information (Invited Talk)}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {2:1--2:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Roland Meyer and Uwe Nestmann},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7806},
URN = {urn:nbn:de:0030-drops-78066},
doi = {10.4230/LIPIcs.CONCUR.2017.2},
annote = {Keywords: Admissibility, non-zero sum games, reactive synthesis, imperfect infor- mation}
}
|
Keywords: |
|
Admissibility, non-zero sum games, reactive synthesis, imperfect infor- mation |
|
Collection: |
|
28th International Conference on Concurrency Theory (CONCUR 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
01.09.2017 |
