Skip to main content
Log in

A Characterization of von Neumann Games in Terms of Memory

  • Published:
Synthese Aims and scope Submit manuscript

Abstract

An information completion of an extensive game is obtained by extending the information partition of every player from the set of her decision nodes to the set of all nodes. The extended partition satisfies Memory of Past Knowledge (MPK) if at any node a player remembers what she knew at earlier nodes. It is shown that MPK can be satisfied in a game if and only if the game is von Neumann (vN) and satisfies memory at decision nodes (the restriction of MPK to a player's own decision nodes). A game is vN if any two decision nodes that belong to the same information set of a player have the same number of predecessors. By providing an axiom for MPK we also obtain a syntactic characterization of the said class of vN games.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • Battigalli, P. and G. Bonanno: 1999, ‘Synchronic Information, Knowledge and Common Knowledge in Extensive Games’, Research in Economics 53, 77–99.

    Google Scholar 

  • van Benthem, J.: 2001, ‘Games in Dynamic Epistemic Logic’, Bulletin of Economic Research 53, 219–248.

    Article  Google Scholar 

  • Bonanno, G.: 2003, ‘Memory and Perfect Recall in Extensive Games’, Games and Economic Behavior, In Press.

  • Burgess, J.: 1984, ‘Basic Tense Logic’, in D. Gabbay and F. Guenthner (eds), Handbook of Philosophical Logic, Vol. II, D. Reidel Publishing Company, pp. 89–133.

  • Chellas, B.: 1984, Modal Logic: An Introduction, Cambridge University Press.

  • Fagin, R., J. Halpern, Y. Moses, and M. Vardi: 1995, Reasoning about Knowledge, MIT Press.

  • Goldblatt, R.: 1992, Logics of Time and Computation, CSLI Lecture Notes No. 7.

  • Halpern, J. and M. Vardi: 1986, ‘The Complexity of Reasoning about Knowledge and Time, Proceedings 18th ACM Symposium on Theory of Computing, pp. 304–315.

  • Kline, J. J.: 2002, ‘Minimum Memory for Equivalence between ex anteOptimality and Time Consistency, Games and Economic Behavior 38, 278–305.

    Google Scholar 

  • Kuhn, H.W.: 1953, ‘Extensive Games and the Problem of Information’, in H. W. Kuhn and W. W. Tucker (eds), Contributions to the Theory of Games, Vol. II, Princeton University Press, pp. 193–216. Reprinted in Kuhn (1997), pp. 46-68.

  • Kuhn, H. W.: 1997, Classics in Game Theory, Princeton University Press.

  • Ladner, R. and J. Reif: 1986, ‘The Logic of Distributed Protocols (Preliminary Report)’, in J. Halpern (ed.), Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference, Morgan Kaufmann, pp. 207–222.

  • Malcolm, N.: 1963, Knowledge and Certainty, Prentice-Hall.

  • van der Meyden, R.: 1994, ‘Axioms for Knowledge and Time in Distributed Systems with Pperfect Recall, Proc. IEEE Symposium on Logic in Computer Science, pp. 448–457.

  • Munsat, S.: 1966, The Concept of Memory, Random House.

  • Okada, A.: 1987, ‘Complete Inflation and Perfect Recall in Extensive Games, International Journal of Game Theory 16, 85–91.

    Article  Google Scholar 

  • Piccione, M. and A. Rubinstein: 1997, ‘On the Interpretation of Decision Problems with Imperfect Recall’, Games and Economic Behavior 20, 3–24.

    Google Scholar 

  • Prior, A. N.: 1956, Time and Modality, Oxford University Press.

  • Ritzberger, K.: 1999, ‘Recall in Extensive Form Games’, International Journal of Game Theory 28, 69–87.

    Article  Google Scholar 

  • Selten, R.: 1975, ‘Re-examination of the Perfectness Concept for Equilibrium Points in Extensive Games’, International Journal of Game Theory 4, 25–55. Reprinted in Kuhn (1997), 317–354.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonanno, G. A Characterization of von Neumann Games in Terms of Memory. Synthese 139, 281–295 (2004). https://doi.org/10.1023/B:SYNT.0000024905.25386.3d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SYNT.0000024905.25386.3d

Keywords

Navigation