Many centralized matching schemes incorporate a mix of random lottery and non-lottery tie-breaking. A leading example is the New York City public school district, which uses criteria like test scores and interviews to generate applicant rankings for some schools, combined with lottery...

We study the revenue maximizing allocation of m units among n symmetric agents with unit demand that have convex preferences over the probability of receiving an object. We show that such preferences are naturally induced by a game where the agents take costly actions that affect their values...

Strausz (2017) claims that crowdfunding implements the optimal mechanism design outcome in an environment with entrepreneurial moral hazard and private cost information. Unfortunately, his analysis, solution and claim depend critically on imposing an untenable condition (29) that he had...

We study optimal incentive contracts with multiple agents when performance evaluation is delegated to 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 determines a...

We provide an introduction into the recent developments of dynamic mechanism design with a primary focus on the quasilinear case. First, we describe socially optimal (or efficient) dynamic mechanisms. These mechanisms extend the well known Vickrey-Clark-Groves and D'Aspremont-Gérard-Varet...

Dynamic mechanisms are a powerful technique in designing revenue-maximizing repeated auctions. Despite their strength, these types of mechanisms have not been widely adopted in practice for several reasons, e.g., for their complexity, and for their sensitivity to the accuracy of predicting...

Using over 5000 equity and option trades unequivocally based on nonpublic information about firm fundamentals, we find that commonly used asymmetric information proxies (AIPs) display abnormal values on days with informed trading. Volatility and trading volume are abnormally high, whereas...

We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and...

Many institutions use matching algorithms to allocate resources to individuals. Examples include the assignment of doctors, students and military cadets to hospitals, schools and branches, respectively. Oftentimes, agents' ordinal preferences are highly correlated, motivating the use of...