Abstract: We motivate procedural fairness for matching mechanisms and study two procedu-rally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give vari-ous examples of probability distributions on the set of stable matchings and discuss properties that differentiate employment by lotto and the random order mechanism. Finally, we consider an adjustment of the random order mechanism, the equitable random order mechanism, that combines aspects of procedural and “endstate ” fairness
I study large random assignment economies with a continuum of agents and a finite number of object t...
We consider the egalitarian welfare of random assignment mechanisms when agents have unrestricted ca...
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized...
We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable m...
Summary. We motivate procedural fairness for matching mechanisms and study two procedurally fair and...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
In the college admissions problem, we consider the incentives confronting agents who face the prospe...
We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable...
Procedural fairness plays a prominent role in the social discourse concerning the marketplace in par...
We consider centralized matching markets in which, starting from an arbitrary match¬ing, firms are s...
This paper experimentally studies an essential institutional feature of matching markets: Randomizat...
We extend the study of procedural fairness in three new directions. Firstly, we focus on lotteries d...
We propose a solution to the conflict between fairness and efficiency in one-sided matching markets....
In this dissertation, I study the properties of and propose the use of a family of random mechanisms...
I study large random assignment economies with a continuum of agents and a finite number of object t...
We consider the egalitarian welfare of random assignment mechanisms when agents have unrestricted ca...
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized...
We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable m...
Summary. We motivate procedural fairness for matching mechanisms and study two procedurally fair and...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
In the college admissions problem, we consider the incentives confronting agents who face the prospe...
We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable...
Procedural fairness plays a prominent role in the social discourse concerning the marketplace in par...
We consider centralized matching markets in which, starting from an arbitrary match¬ing, firms are s...
This paper experimentally studies an essential institutional feature of matching markets: Randomizat...
We extend the study of procedural fairness in three new directions. Firstly, we focus on lotteries d...
We propose a solution to the conflict between fairness and efficiency in one-sided matching markets....
In this dissertation, I study the properties of and propose the use of a family of random mechanisms...
I study large random assignment economies with a continuum of agents and a finite number of object t...
We consider the egalitarian welfare of random assignment mechanisms when agents have unrestricted ca...
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized...