Information Tracking in Games on Graphs
When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acquired in a play of infinite duration may, however, lead to infinite hierarchies of higher-order knowledge. We present a construction that makes explicit which higher-order knowledge is relevant in a game and allows us to describe a class of games that admit coordinated winning strategies with finite memory.
KeywordsInfinite games Imperfect information Distributed strategies Multiplayer games
Unable to display preview. Download preview PDF.
- Arnold, A., & Walukiewicz, I. (2007). Nondeterministic controllers of nondeterministic processes. In Logic and automata (Vol. 2). Amsterdam University Press.Google Scholar
- Berwanger, D. (2010). Infinite coordination games. In Logic and the foundations of game and decision theory (LOFT9), texts in logic and games. Amsterdam University Press, To appear.Google Scholar
- Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2006). Algorithms for omega-regular games with imperfect information. In Proceedings of the 20th International Workshop on Computer Science Logic (CSL), 15th Annual Conference of the EACSL, Vol. 4207 of LNCS (pp. 287–302). Springer.Google Scholar
- Gale D., Stewart F. M. (1953) Infinite games with perfect information. Annals of Mathematics Studies 28: 245–266Google Scholar
- Henzinger, T. A. (2005) Games in system design and verification. In Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005).Google Scholar
- Kupferman, O., & Vardi, M. Y. (2001). Synthesizing distributed systems, In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science.Google Scholar
- Peterson, G. L., & Reif, J. H. (1979). Multiple-Person alternation. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, (FOCS 1979), IEEE (pp. 348–363).Google Scholar
- Pnueli, A., & Rosner, E. (1989). On the synthesis of a reactive module. In Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 179–190). ACM Press.Google Scholar
- Rudie, K., & Wonham, W. M. (1990). Supervisory control of communicating processes. In L. Logrippo, R. L. Probert, & H. Ural (Eds.), Proceedings of PSTV 1990, Tenth International Symposium on Protocol Specification, Testing and Verification (pp. 243–257). North-Holland.Google Scholar
- Thomas, W. (1995). On the synthesis of strategies in infinite games. In STACS 95, Proceedings of the Symposium on Theoretical Aspects of Computer Science (pp. 1–13).Google Scholar
- Walukiewicz, I. (2004). A landscape with games in the background. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2004) (pp. 356–366).Google Scholar