Game-theoretic axioms for local rationality and bounded knowledge
journal contributionposted on 1993-01-01, 00:00 authored by Cristina Bicchieri, Gian Aldo. Antonelli
Abstract: "We present an axiomatic approach for a class of finite, extensive form games of perfect information that makes use of notions like 'rationality at a node' and 'knowledge at a node.' We show that, in general, a theory that is sufficient to infer an equilibrium must be modular: for each subgame G ╠üof a game G the theory of game G must contain just enough information about the subgame G ╠üto infer an equilibrium for G.╠ü This means, in general, that the level of knowledge relative to any subgame of G must not be the same as the level of knowledge relative to the original game G. We show that whenever the theory of the game is the same at each node, a deviation from equilibrium playforces a revision of the theory at later nodes.On the contrary, whenever a theory of the game is modular, a deviation from equilibrium play does not cause any revision of the theory of the game."