A characterization of von Neumann games in terms of memory

Search all papers

Notify me of new papers
via Email or RSS

A characterization of von Neumann games in terms of memory
Giacomo Bonanno, University of California, Davis

	Download the Article (325 K, PDF file) - 2004	Tell a colleague about it.
	Printing Tips: Select 'print as image' in the Acrobat print dialog if you have trouble printing.

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.

SUGGESTED CITATION:
Giacomo Bonanno, "A characterization of von Neumann games in terms of memory" (2004). Synthese. 139 (2), pp. 281-295. Postprint available free at: http://repositories.cdlib.org/postprints/24

REQUIRED PUBLISHER STATEMENT:
The original publication is available at www.springerlink.com in the journal Synthese.

eScholarship is a service of the California Digital Library