Abstract
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for the so-called stable marriage problem. We complement Aldershof et al.'s (1999) analysis in two ways. First, we give an alternative and intuitive description of employment by lotto in terms of a probabilistic serial dictatorship on the set of stable matchings. Second, we show that Aldershof et al.'s (1999) conjectures are correct for small matching markets but not necessarily correct for large matching markets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
