Abstract
We consider games where the players have perfect information about the game’s state and history, and we focus on the information exchange that takes place at each round as the players choose their moves. The abilityof a player to gather information on the opponent’s choice of move in a round determines her ability to counteract the move, and win the game. When the game is played between teams, rather than single players, the amount of intra-team communication determines the ability of the team members to coordinate their moves and win the game. We consider games with quantitative bounds on inter-team and intra-team information flow, and we provide algorithms and complexity bounds for their solution.
This research was supported in part by the NSF CAREER award CCR-0132780, the NSF grant CCR-0234690, the ONR grant N00014-02-1-0671, and the MIUR grant “Metodi Formali per la Sicurezza e il Tempo” (MEFISTO).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symp. Found. of Comp. Sci., pages 100–109. IEEE Computer Society Press, 1997.
J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295–311, 1969.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proc. 15th IEEE Symp. Logic in Comp. Sci., pages 141–154, 2000.
L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symp. Found. of Comp. Sci., pages 564–575. IEEE Computer Society Press, 1998.
L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. The control of synchronous systems. In CONCUR 00: Concurrency Theory. 11th Int. Conf., volume 1877 of Lect. Notes in Comp. Sci., pages 458–473. Springer-Verlag, 2000.
L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. The control of synchronous systems part II. In CONCUR 01: Concurrency Theory. 12th Int. Conf., volume 2154 of Lect. Notes in Comp. Sci., pages 566–581. Springer-Verlag, 2001.
E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In Proc. 32nd IEEE Symp. Found. of Comp. Sci., pages 368–377. IEEE Computer Society Press, 1991.
J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer-Verlag, 1997.
Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. 14th ACM Symp. Theory of Comp., pages 60–65. ACM Press, 1982.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.
O. Kupferman and M.Y. Vardi. Synthesis with incomplete informatio. In 2nd International Conference on Temporal Logic, pages 91–106, Manchester, July1997.
O. Kupferman and M.Y. Vardi. Synthesizing distributed systems. In Proc. 16th IEEE Symp. on Logic in Computer Science, July 2001.
G.L. Peterson and J.H. Reif. Multiple-person alternation. In Proc. 20th IEEE Symp. Found. of Comp. Sci., pages 348–363, 1979.
A. Pnueli and R. Rosner. Distributed-reactive systems are hard to synthesize. In Proc. 31th IEEE Symp. Found. of Comp. Sci., pages 746–757, 1990.
J.H. Reif. The compexityof two-player games of incomplete information. Journal of Computer and System Sciences, 29:274–301, 1984.
L.S. Shapley. Stochastic games. Proc. Nat. Acad. Sci. USA, 39:1095–1100, 1953.
W. Thomas. On the synthesis of strategies in infinite games. In Proc. of 12th Annual Symp. on Theor. Asp. of Comp. Sci., volume 900 of Lect. Notes in Comp. Sci., pages 1–13. Springer-Verlag, 1995.
D. Williams. Probability With Martingales. Cambridge University Press, 1991.
Wiesaw Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135–183, June 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Alfaro, L., Faella, M. (2003). Information Flow in Concurrent Games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_80
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive