Corrigendum to "Resource-monotonicity for house allocation problems"
نویسندگان
چکیده
Ehlers and Klaus (2003) study so-called house allocation problems and claim to characterize all rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity on two preference domains (Ehlers and Klaus, 2003, Theorem 1). They explicitly prove Theorem 1 for preference domain R0 which requires that the null object is always the worst object and mention that the corresponding proofs for the larger domain R of unrestricted preferences “are completely analogous.” Quesada (2009) in a recent working paper claims to have found a counterexample that shows that Theorem 1 is not correct on the unrestricted domain R. In Lemma 1, we prove that Quesada’s (2009) example in not a counterexample to Ehlers and Klaus (2003, Theorem 1). However, in Example 1 and Lemma 2, we demonstrate how to adjust Quesada’s (2009) original idea to indeed establish a counterexample to Ehlers and Klaus (2003, Theorem 1) on the general domain R. Quesada (2009) also proposes a way of correcting the result on the general domain R by strengthening independence of irrelevant objects in two ways: in addition to requiring that the chosen allocation should depend only on preferences over the set of available objects (which always includes the null object), he adds two situations in which the allocation should also be invariant when preferences over the null object change. We here demonstrate that it is sufficient to require only one of Quesada’s (2009) additional independence requirements to reestablish the result of Theorem 1 on the general domain R. Finally, while Quesada (2009) essentially replicates the original proofs of Ehlers and Klaus (2003) using his stronger independence condition, here we offer a short proof that uses the established result of Theorem 1 for the restricted domain R0. JEL Classification: D63, D70
منابع مشابه
Resource-monotonicity for house allocation problems
We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step t...
متن کاملObject allocation via deferred-acceptance: Strategy-proofness and comparative statics
We study the problem of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, school or university admissions etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We consider mechanisms satisfying a set of basic properties (unavailable-type-invariance, individual-rationality, weak non-wastefulness, or truncation-invariance)....
متن کاملThe ‘Boston’ School Choice Mechanism
The Boston mechanism is a popular student placement mechanism in school choice programs around the world. We provide two characterizations of the Boston mechanisms. We introduce two new axioms, respect of preference rankings and rank-respecting Maskin monotonicity. A mechanism is the Boston mechanism for some priority if and only if it respects preference rankings and satisfies consistency, res...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 2011