We investigate a common-value labor setting in which firms interview a worker prior to hiring. When firms have private information about the worker’s value and interview decisions are kept private, many firms may enter the market, interview, and hire with positive probability. When firms’...

We investigate a common-value labor setting in which firms interview a worker prior to hiring. When firms have private information about the worker’s value and interview decisions are kept private, many firms may enter the market, interview, and hire with positive probability. When firms’...

We study optimal incentive contracts with multiple agents when performance is evaluated by a reviewer. The reviewer may be biased in favor of the agents, but the degree of bias is unknown to the principal. We show that a contest, which is a contract in which the principal fixes a set of prizes...

We present a theoretical explanation of inefficient early matching in matching markets. Our explanation is based on strategic complementarities and strategic unraveling. We identify a negative externality imposed on the rest of the market by agents who make early offers. As a consequence, an...

We present a theoretical explanation of inefficient early matching in matching markets. Our explanation is based on strategic complementarities and strategic unraveling. We identify a negative externality imposed on the rest of the market by agents who make early offers. As a consequence, an...

We study a multi-dimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate-wise median. Judicious rotations of the orthogonal axes -- the issues that are voted upon -- lead to...

The theory of full implementation has been criticized for using integer/modulo games which admit no equilibrium (Jackson (1992)). To address the critique, we revisit the classical Nash implementation problem due to Maskin (1977, 1999) but allow for the use of lotteries and monetary transfers as...

Manipulability is a threat to the successful design of centralized matching markets. However, in many applications some manipulation is inevitable and the designer wants to compare manipulable mechanisms. We count the number of agents with an incentive to manipulate and rank mechanisms by their...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We consider deterministic dominant strategy implementation in multidimensional dichotomous domains in private values and quasi-linear utility setting. In such multidimensional domains, an agent’s type is characterized by a single number, the value of the agent, and a non-empty set of...