We here develop a model of pre-play communication that generalizes the cheap-talk approach by allowing players to have a lexicographic preference, second to the payoffs in the underlying game, for honesty. We formalize this by way of an honesty (or truth) correspondence between actions and...

Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there is a unique connected and contractible...

Both complete and incomplete game Theoretic Models of Voter Turnout (Palfrey and Rosenthal, 1983,1985) have the problem of multiple equilibria, some of which seem unreasonable. How can the counter intuitive high turnout equilibria be explained? Palfrey and Rosenthal (1985) suggest that the main...

Language is a powerful coordination device. We generalize the cheap-talk approach to pre-play communication by way of introducing a meaning correspondence between messages and actions, and by postulating two axioms met by natural languages. Players have a lexicographic preference, second to...

Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there is a unique connected and contractible...

We show that in long repeated games, or in infinitely repeated games with discount rate close to one, payoffs corresponding to evolutionary stable sets are asymptotically efficient, as intuition suggests. Actions played at the beginning of the game are used as messages that allow players to...

We consider quasi-orderings of infinite utility streams satisfying the strong Pareto axiom (i.e., Paretian quasi-orderings) and study the question of how strong a notion of intergenerational equity one can impose on these quasi-orderings without generating an impossibility theorem. Building on a...