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...

We analyze the k-ticket lottery, which is used to allocate hunting permits in the state of Alaska. Each participant is given k tickets to distribute among lotteries for different types of items. Participants who win multiple items receive their favorite, and new winners are drawn from the...