Aggregate Efficiency in Random Assignment Problems∗

Abstract

We introduce aggregate efficiency (AE) for random assignments (RA) by requiring higher expected numbers of agents be assigned to their more preferred choices. It is shown that the realizations of any aggregate efficient random assignment (AERA) must be an AE permutation matrix. While AE implies ordinally efficiency, the reverse does not hold. And there is… (More)

Topics

3 Figures and Tables

Slides referencing similar topics