Abstract
This paper considers an allocation problem with a finite number of objects and unit-demand agents. The main result is a characterization of a class of strategy-proof price mechanisms on a general domain where preferences over pairs of objects and houses are rational, monotonic, and continuous. A mechanism belongs to this class if and only if the price space is restricted in a special way and, given this restriction, that the mechanism selects minimal equilibrium prices.
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.
