We study procedurally fair matching mechanisms that produce stable matchings for the so-called marriage model of one-to-one, two-sided matching. Our main focus is on two such mechanisms: employment by lotto introduced by Aldershof et al. (1999) and the random order mechanism due to Roth and...

We motivate procedural fairness for matching mechanisms and study two procedurally 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 various examples of probability...

We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable marriage problem. We complement Aldershof et al.'s analysis in two ways. First, we give an alternative and intuitive description of employment by lotto. Second, we disprove Aldershof et al.'s...

We consider centralized matching markets in which, starting from an arbitrary match- ing, frms are successively chosen in a random fashion and offer their positions to the workers they prefer the most. We propose an algorithm that generalizes some well-known algorithms and explore some of its...

In two-sided matching markets, stable mechanisms are vulnerable to various kinds of manipulations. This paper investigates conditions for the student-optimal stable mechanism (SOSM) and the college-optimal stable mechanism (COSM) to be immune to manipulations via capacities and pre-arranged...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matching exists in a discrete matching market when firms' preference profile satisfies a...