In games with costly signaling, some equilibria are vulnerable to deviations which could be "unambiguously" interpreted as coming from a unique set of Sender-types. This occurs when these types are precisely the ones who gain from deviating for any beliefs the Re-ceiver could form over that set....

We define and analyze a "strategic topology" on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...

In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous- time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a plausible...

Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible...

"Approximate truth" refers to the principle that border cases should be analyzed by solving generic cases and solving border cases as limits of generic ones (Brennan et al., 2008). Our study experimentally explores whether this conceptual principle is also behaviorally appealing. To do so, we...

"Approximate truth" refers to the principle that border cases should be analyzed by solving generic cases and solving border cases as limits of generic ones (Brennan et al., 2008). Our study experimentally explores whether this conceptual principle is also behaviorally appealing. To do so, we...

We study the impact of advice or observation on the depth of reasoning in an experimental beauty-contest game. Both sources of information trigger faster convergence to the equilibrium. Yet, we find that subjects who receive naive advice outperform uninformed subjects permanently, whereas...

We introduce intention-based social preferences into a mechanism design framework with independent private values and quasilinear payoffs. For the case where the designer has no information about the intensity of social preferences, we provide conditions under which mechanisms which have been...

We introduce intention-based social preferences into mechanism design. We explore information structures that dier with respect to what is commonly known about the weight that agents attach to reciprocal kindness. When the designer has no information on reciprocity types, implementability of an...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu,1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...