Abstract
The standard way of modelling imperfect information in games is in terms of information partitions for players. In this view, each player is associated with an equivalence relation over the set of game positions. For multiplayer games of imperfect information defined in this manner it turns out that most of the algorithmic questions like determining the winning strategy and synthesis of an equilibrium profile are undecidable. In this light, we propose a model where the players’ information partitions are generated explicitly by means of communication. We define a notion of locally consistent equilibrium and suggest that this captures the intuition of stable behaviour of players better. We show that when communication is by means of public announcements, the question of whether locally consistent equilibrium profile exists 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
Arnold, A., Walukiewicz, I.: Nondeterministic controllers of nondeterministic processes. In: Logic and Automata: History and Perspectives. Texts in Logic and Games, vol. 2, pp. 29–52. Amsterdam University Press (2007)
Bernet, J.: Discrete games for the synthesis and validation of communication processes. PhD thesis, University of Bordeaux (2006)
Bernet, J., Janin, D.: Automata theory for discrete distributed games. Technical report, LaBRI, University of Bordeaux (2005)
Berwanger, D., Kaiser, L.: Information tracking in games on graphs. Journal of Logic, Language and Information (2010)
Chatterjee, K., Doyen, L., Henzinger, T., Raskin, J.-F.: Algorithms for omega-regular games of imperfect information. Logical Methods in Computer Science 3(3:4) (2007)
Gastin, P., Lerman, B., Zeitoun, M.: Distributed games and distributed control for asynchronous systems. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 455–465. Springer, Heidelberg (2004)
Gastin, P., Sznajder, N., Zeitoun, M.: Distributed synthesis for well-connected architectures. Formal Methods in System Design 34, 215–237 (2009)
Gripon, V., Serre, O.: Qualitative concurrent stochastic games with imperfect information. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 200–211. Springer, Heidelberg (2009)
Halpern, J.: A computer scientist looks at game theory. Games and Economic Behavior 45(1) (2003)
Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Logic, Methodology and Philosophy of Science, vol. 8, pp. 571–589. Elsevier, Amsterdam (1989)
Lamport, L., Pease, M., Shostak, R.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 338–351. Springer, Heidelberg (2003)
Peterson, G., Reif, J.: Multi-person alternation. In: Proceedings of FOCS 1979, pp. 348–363. IEEE, Los Alamitos (1979)
Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of FOCS 1990, pp. 746–757 (1990)
Schewe, S.: Uniform distributed synthesis. In: Proceedings of LICS 2005, pp. 321–330 (2005)
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
Ramanujam, R., Simon, S. (2010). A Communication Based Model for Games of Imperfect Information. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)