A standing question in the theory of matching markets is how to define stability under incomplete information. This paper proposes an epistemic approach. Agents negotiate through offers, and offers are interpreted according to the highest possible degree of rationality that can be ascribed to...

I investigate the design of effort-maximizing mechanisms when agents have both private information and convex effort costs, and the designer has a fixed prize budget. I first demonstrate that it is always optimal for the designer to utilize a contest with as many participants as possible....

Agents with reciprocal preferences prefer to be matched to a partner who also likes to collaborate with them. In this paper, we introduce and formalize reciprocal preferences, apply them to matching markets, and analyze the implications for mechanism design. Formally, the preferences of an agent...

We study large-population repeated games where players are symmetric but not anonymous, so player-specific rewards and punishments are feasible. Players may be commitment types who always take the same action. Even though players are not anonymous, we show that an anti-folk theorem holds when...

We report on the results of an experiment designed to disentangle behavioral biases in information aggregation of committees. Subjects get private signals about the state of world, send binary messages, and finally vote under either majority or unanimity rules. Committee decisions are...

We study identification of preferences in static single-agent discrete choice models where decision makers may be imperfectly informed about the state of the world. We leverage the notion of one-player Bayes Correlated Equilibrium by Bergemann and Morris (2016) to provide a tractable...