Assignment maximization

Abstract We evaluate the goal of maximizing the number of individuals matched to acceptable outcomes. We present two mechanisms that maximize assignments. The first is Pareto efficient and undominated—in terms of the number of assignments—in equilibrium. The second is fair for unassigned agents and assigns weakly more agents than any stable mechanism in equilibrium.