We consider mechanisms for allocating a common-value prize between two players in an incomplete information setting. In this setting, each player receives an independent private signal about the prize value. The signals are from a discrete distribution and the value is increasing in both...

We study a setting in which dynamically arriving items are assigned to waiting agents, who have heterogeneous values for distinct items and heterogeneous outside options. An ideal match would both target items to agents with the worst outside options, and match them to items for which they have...

A principal distributes an indivisible good to budget-constrained agents when both valuation and budget are agents' private information. The principal can verify an agent's budget at a cost. The welfare-maximizing mechanism can be implemented via a two-stage scheme. First, agents report their...

A principal wishes to distribute an indivisible good to a population of budget-constrained agents. Both valuation and budget are an agent's private information. The principal can inspect an agent's budget through a costly verification process and punish an agent who makes a false statement. I...

The auction designer has one favorite among bidders and maximizes hisutility by choosing an auction plan, i.e., choosing the auction format conditionalon the favorite's value. I show that the designer can favor one of the bidderseven if favoritism within an auction is not allowed. In this case,...

A principal distributes an indivisible good to budget‐constrained agents when both valuation and budget are agents' private information. The principal can verify an agent's budget at a cost. The welfare‐maximizing mechanism can be implemented via a two‐stage scheme. First, agents report...