Digital Commons Network^™

On Random Assignment Problems, Peng Liu

Dissertations and Theses Collection

This dissertation studies the standard random assignment problem (Bogomolnaia and Moulin (2001)) and investigates the scope of designing a desirable random assignment rule. Specifically, I ask the following two questions:

1. Is there a reasonably restricted domain of preferences on which there exists an strategy-sd-efficient proof, sd-efficient and sd-envy-free or equal-treatment-of-equals rule?

2. Moreover, if the answer is in the affirmative, what is that rule?

As a starting point, attention is restricted to the connected domains (Monjardet (2009)). It is shown that if a connected domain admits a desirable random assignment rule, it is structured in a specific way: a …