Dynamic assignment without money: Optimality of spot mechanisms

2021

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.2139/ssrn.3894259
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We study a large market model of dynamic matching with no monetary transfers and a continuum of agents who have to be assigned items at each date. When the social planner can only elicit ordinal agents' preferences, we prove that under a mild regularity assumption, incentive compatible and ordinally efficient allocation rules coincide with spot mechanisms. The latter specify “virtual prices” for items at each date and, for each agent, randomly select a budget of virtual money at the beginning of time. When the social planner can elicit cardinal preferences, we prove that under a similar regularity assumption, incentive compatible and Pareto efficient mechanisms coincide with spot menu of random budgets mechanisms. These are similar to spot mechanisms except that, at the beginning of time, each agent chooses within a menu, a distribution over budget of virtual money.