A characterization of von Neumann games in terms of memory
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.
- Knowledge condition games
- Recall in extensive form games
- Memoryless determinacy of finite parity games: another simple proof
- Memory and perfect recall in extensive games
- Characterizations of perfect recall
- scientific article; zbMATH DE number 3902437 (Why is no real title available?)
- scientific article; zbMATH DE number 3968395 (Why is no real title available?)
- scientific article; zbMATH DE number 1786177 (Why is no real title available?)
- Information flows and memory in games
This page was built for publication: A characterization of von Neumann games in terms of memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431876)
