Strategy-Proof Allocation of Objects: A Characterization Result
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, give