Abstract

In house allocation problems, we look for a systematic way of assigning a set of indivisible objects, e.g., houses, to a group of individuals having preferences over these objects. Typical real life examples are graduate housing, assignment of offices and tasks. Once an allocation is decided upon, the actual assignments of the agents are not likely to take place simultaneously. Therefore, rules whose predictions are independent of the sequence in which the actual assignments are realized turn out to be very appealing. We model this property via the consistency principle and identify various classes of consistent rules and correspondences.

Full Text
Paper version not known

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

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.