Abstract
AbstractWe introduce (strict) favoring upper ranks, which is an extension of favoring higher ranks for random assignments. We demonstrate that ex post favoring ranks implies (strict) favoring upper ranks, and envy‐freeness implies favoring upper ranks. Moreover, for at least four agents, no mechanism satisfies strict favoring upper ranks and either equal division lower bound or equal treatment of equals and lower invariance. Finally, we proved that the (modified) eating algorithm provides a random assignment that is (strict) favoring upper ranks.
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.
