Strategic planning for probabilistic games with incomplete information

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2010, Pages 1057-1064

  Schnoor, Henning ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Alternating time Temporal Logic; Incomplete information; Probability

Indexed keywords

MODEL CHECKING; MULTI AGENT SYSTEMS; PROBABILITY; SEMANTICS;

ALTERNATING TIME TEMPORAL LOGIC; BISIMULATIONS; INCOMPLETE INFORMATION; MEMORYLESS STRATEGIES; MODEL CHECKING PROBLEM; PROBABILISTIC GAMES; SIMULATION RELATION;

AUTONOMOUS AGENTS;

EID: 84899425453     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, 2002.
2. R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In D. Sangiorgi and R. de Simone, editors, CONCUR, Volume 1466 of Lecture Notes in Computer Science, pages 163-178. Springer, 1998.
3. N. Bulling and W. Jamroga. What agents can probably enforce. Fundamenta Informaticae, 93(1-3):81-96, 2009.
4. T. Chen and J. Lu. Probabilistic alternating-time temporal logic and model checking algorithm. In J. Lei, editor, FSKD (2), pages 35-39. IEEE Computer Society, 2007.
5. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In FOCS, pages 338-345. IEEE, 1988.
6. A. Herzig and N. Troquard. Knowing how to play: uniform choices in logics of agency. In Nakashima et al. [14], pages 209-216.
7. W. Jamroga. Some remarks on alternating temporal epistemic logic. In Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS 2003, pages 133-140, 2004.
8. W. Jamroga. Strategic planning through model checking of ATL formulae. In L. Rutkowski, J. H. Siekmann, R. Tadeusiewicz, and L. A. Zadeh, editors, ICAISC, Volume 3070 of Lecture Notes in Computer Science, pages 879-884. Springer, 2004.
9. W. Jamroga and T. Agotnes. What agents can achieve under incomplete information. In Nakashima et al. [14], pages 232-234.
10. W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 63(2-3):185-219, 2004.
11. D. Kahler, R. Küsters, and T. Truderung. Infinite state AMC-model checking for cryptographic protocols. In LWS, pages 181-192. IEEE Computer Society, 2007.
12. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security, 11(3):399-430, 2003.
13. F. Laroussinie, N. Markey, and G. Oreiby. On the expressiveness and complexity of ATL. Logical Methods in Computer Science, 4(2:7):1-25, 2008.
14. H. Nakashima, M. P. Wellman, G. Weiss, and P. Stone, editors. 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006. ACM, 2006.
15. H. Schnoor. Probabilistic ATL with incomplete information. Technical Report 0918, Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 2009.
16. P.-Y. Schobbens. Alternating-time logic with imperfect recall. Electronis Notes in Theoretical Computer Science, 85(2):82-93, 2004.