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...

A large number of individuals are randomly matched into groups, where each group plays a finite symmetric game. Individuals breed true. The expected number of surviving offspring depends on own material payoff, but may also, due to cooperative breeding and/or reproductive competition, depend on...

In the text-book model of dynamic Bertrand competition, competing firms meet the same demand function every period. This is not a satisfactory model of the demand side if consumers can make intertemporal substitution between periods. Each period then leaves some residual demand to future...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

We model a player's uncertainty about other player's strategy choices as probability distributions over their strategy sets. We call a strategy profile robust to strategic uncertainty if it is the limit, as uncertainty vanishes, of some sequence of strategy profiles in each of which every...