Abstract
The probabilistic serial mechanism (Bogomolnaia and Moulin, 2001 [9]) is ordinally efficient but not strategy-proof. We study incentives in the probabilistic serial mechanism for large assignment problems. We establish that for a fixed set of object types and an agent with a given expected utility function, if there are sufficiently many copies of each object type, then reporting ordinal preferences truthfully is a weakly dominant strategy for the agent (regardless of the number of other agents and their preferences). The non-manipulability and the ordinal efficiency of the probabilistic serial mechanism support its implementation instead of random serial dictatorship in large assignment problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.