Information-revelation in incomplete-information games
Kjell Åke Nygren · OhioLink ETD Center (Ohio Library and Information Network) · 1999
Our thesis concentrates on information-revelation in games with incomplete information.In chapter 2, we examine a one-shot version of a particular formulation of games with incomplete information due to Harsanyi [10].The chaper examines the extent to which all interior Bayesian equilibria of such games are fully information-revealing as well as the extent to which the number of interior Bayesian equilibria is finite.One of our theorems states that, given a fixed common prior, the two properties hold generically in the space of twice continuously differentiable utility function bundles.Another theorem