The Complexity of Partial-Observation Parity Games-Reference-Cited by-同舟云学术

The Complexity of Partial-Observation Parity Games

Published:2010 Issue: Volume: Page:1-14
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Chatterjee Krishnendu,Doyen Laurent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-16242-8_1

Reference26 articles.

1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49, 672–713 (2002)

2. Lecture Notes in Computer Science;C. Baier,2008

3. Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS, pp. 319–328. IEEE Computer Society, Los Alamitos (2009)

4. Berwanger, D., Doyen, L.: On the power of imperfect information. In: FSTTCS, Dagstuhl Seminar Proceedings 08004. Internationales Begegnungs- und Forschungszentrum fuer Informatik, IBFI (2008)

5. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS 138, 295–311 (1969)

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Perspective Games;ACM Transactions on Computational Logic;2024-01-17

2. A Game-Theoretic Approach to Indistinguishability of Winning Objectives as User Privacy;Theoretical Aspects of Computing – ICTAC 2023;2023

3. Perspective Multi-Player Games;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

4. Strategy Logic with Imperfect Information;ACM Transactions on Computational Logic;2021-01-22

5. Games with Full, Longitudinal, and Transverse Observability;Lecture Notes in Computer Science;2020