Abstract
Consider a player playing against different opponents in two extensive form games simultaneously. Can she then have a strategy in one game using information from the other? The famous example of playing chess against two grandmasters simultaneously illustrates such reasoning. We consider a simple dynamic logic of extensive form games with sequential and parallel composition in which such situations can be expressed. We present a complete axiomatization and show that the satisfiability problem for the logic is decidable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrahamson, K.: Decidability and expressiveness of logics of processes. PhD thesis, Dept. of Computer Science, Univ. of Washington (1980)
Ågotnes, T.: Action and knowledge in alternating time temporal logic. Synthese 149(2), 377–409 (2006)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49, 672–713 (2002)
Broersen, J.: CTL.STIT: Enhancing ATL to express important multi-agent system verification properties. In: Proceedings of AAMAS 2010. ACM Press, New York (2010)
Broersen, J., Herzig, A., Troquard, N.: Embedding Alternating-time Temporal Logic in strategic STIT logic of agency. Journal of Logic and Computation 16(5), 559–578 (2006)
Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 34–53. Springer, Heidelberg (1985)
Goranko, V.: Coalition games and alternating temporal logics. In: Proceedings of TARK 2001, pp. 259–272 (2001)
Harel, D.: Dynamic logic. In: Handbook of Philosophical Logic, vol. 2, pp. 496–604 (1984)
Harel, D., Kozen, D., Parikh, R.: Process logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences 25(2), 144–170 (1982)
Horty, J.: Agency and Deontic Logic. Oxford University Press, Oxford (2001)
Lange, M., Lutz, C.: 2-EXPTIME lower bounds for propositional dynamic logics with intersection. Journal of Symbolic Logic 70(4), 1072–1086 (2005)
Parikh, R.: The logic of games and its applications. Annals of Discrete Mathematics 24, 111–140 (1985)
Pauly, M.: Logic for Social Software. PhD thesis, Univ. of Amsterdam (2001)
Peleg, D.: Concurrent dynamic logic. Journal of the ACM 34(2), 450–479 (1987)
Ramanujam, R., Simon, S.: Dynamic logic on games with structured strategies. In: Proceedings of KR 2008, pp. 49–58. AAAI Press, Menlo Park (2008)
van Benthem, J.: Extensive games as process models. Journal of Logic Language and Information 11, 289–313 (2002)
van Benthem, J., Ghosh, S., Liu, F.: Modelling simultaneous games with dynamic logic. Synthese (Knowledge, Rationality and Action) 165, 247–268 (2008)
van der Hoek, W., Jamroga, W., Wooldridge, M.: A logic for strategic reasoning. In: Proceedings of AAMAS 2005, pp. 157–164 (2005)
Walther, D., van der Hoek, W., Wooldridge, M.: Alternating-time temporal logic with explicit strategies. In: Proceedings of TARK 2007, pp. 269–278 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, S., Ramanujam, R., Simon, S. (2010). Playing Extensive Form Games in Parallel. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2010. Lecture Notes in Computer Science(), vol 6245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14977-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-14977-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14976-4
Online ISBN: 978-3-642-14977-1
eBook Packages: Computer ScienceComputer Science (R0)