Abstract
We prove that the “Boston mechanism” designed by Bogomolnaia [J. Econ. Theory 158 (2015) 308–318] to solve the random assignment problem fails to be lexicographically strategy-proof. Consequently, an open question emerges: Is the Serial rule the unique solution satisfying envy-freeness, efficiency and strategy-proofness on the lexicographic preference domain extension for lotteries?
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
