Abstract
For priority-based allocation of indivisible objects to agents with unit demand, when each object has exactly one copy, Abdulkadiroglu et al. (2019) show that the priority-based top trading cycles mechanism is justified envy minimal, in the sense that no strategy proof and Pareto efficient mechanism has strictly less justified envy than it. It remains open whether there is a unique justified envy minimal mechanism. We propose a strategy proof and Pareto efficient variation of the top trading cycles mechanism and show that it is also justified envy minimal.
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.
