A general strategy proof fair allocation mechanism

This paper studies a general problem of efficiently and fairly allocating n indivisible objects like jobs or houses with a certain amount of money to n persons with a requirement that each person be assigned with one object. The precise preferences of individuals over both the objects and money are unknown and manipulable but assumed to follow some general patterns to ensure the existence of a fair allocation. A mechanism is developed that elicits honest preferences over both the objects and money, and that assigns the objects with some money to individuals efficiently and fairly.