Abstract
A random assignment is robust ex-post Pareto efficient whenever for any of its lottery decomposition, each deterministic assignment in its support is Pareto efficient. We show that ordinal efficiency implies robust ex-post Pareto efficiency while the reverse does not hold. We know that strategy-proof and ordinal efficient mechanisms satisfy neither equal treatment of equals nor equal division lower bound. We prove that it is not possible to avoid these two impossibilities by weakening ordinal efficiency to robust ex-post Pareto efficiency.
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.
