The study of matching problems typically assumes that agents pre-cisely know their preferences over the goods to be assigned. Within applied contexts, this assumption stands out as particularly coun-terfactual. Parents typically do invest a large amount of time and resources to find the best school for their children; doctors run costly tests to establish the best kidney for a given patient. In this paper I introduce the assumption of endogenous information acquisition into otherwise standard house allocation problems. I find that there is a unique ex-ante Pareto-optimal, strategy-proof and non-bossy alloca-tion mechanism: serial dictatorship. This stands in sharp contrast to the very large set of such mechanisms for house allocation proble...
This paper studies allocation correspondences in house allocation prob-lems with collective initial ...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
We study a problem of dynamic allocation without money. Agents have arrivals and departures and stri...
The study of matching problems typically assumes that agents precisely know their preferences over t...
Abstract The study of matching problems typically assumes that agents precisely know their preferenc...
The paper introduces the assumption of costly information acquisition to the theory of mechanism des...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
This dissertation studies the problem of allocating heterogeneous indivisible goods to agents withou...
Many real-life applications of house allocation problems are dynamic. For example, in the case of on...
Many real-life applications of house allocation problems are dynamic. For example, in the case of on...
We consider the allocation of indivisible objects when agents have preferences over their own alloca...
We consider the problem of efficiently allocating several indivisible objects between agents who are...
We consider a common indivisible good allocation problem in which agents have both social and privat...
This paper studies allocation correspondences in house allocation prob-lems with collective initial ...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
We study a problem of dynamic allocation without money. Agents have arrivals and departures and stri...
The study of matching problems typically assumes that agents precisely know their preferences over t...
Abstract The study of matching problems typically assumes that agents precisely know their preferenc...
The paper introduces the assumption of costly information acquisition to the theory of mechanism des...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of a...
This dissertation studies the problem of allocating heterogeneous indivisible goods to agents withou...
Many real-life applications of house allocation problems are dynamic. For example, in the case of on...
Many real-life applications of house allocation problems are dynamic. For example, in the case of on...
We consider the allocation of indivisible objects when agents have preferences over their own alloca...
We consider the problem of efficiently allocating several indivisible objects between agents who are...
We consider a common indivisible good allocation problem in which agents have both social and privat...
This paper studies allocation correspondences in house allocation prob-lems with collective initial ...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
We study a problem of dynamic allocation without money. Agents have arrivals and departures and stri...