Abstract
We introduce two notions of ex-post fairness, namely ex-post favoring ranks (EFR) and robust ex-post favoring ranks, which consider whether objects are received by those agents who have the highest rank for them. We examine their compatibility with standard properties of random assignments and state some impossibility theorems. We also propose and formalize a revised version of the Boston mechanism and prove that it provides an EFR random assignment.
Sign-in/Register to access full text options 
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.
