This paper studies allocation correspondences in the house allocation problems with collective initial endowments. We examine the implications of two axioms, namely “consistency” and “unanimity.” Consistency requires the allocation correspondence be invariant under reductions of...

This paper considers the object allocation problem introduced by Shapley and Scarf (1974). We study secure implementation (Saijo, Sjöström, and Yamato, 2007), that is, double implementation in dominant strategy and Nash equilibria. We prove that (i) an individually rational solution is...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...

We study the problem of allocating a bundle of perfectly divisible private goods from an axiomatic point of view, in situations where compensations can be made through monetary transfers. The key property we impose on the allocation rule requires that no agent should be able to gain by...

The paper introduces the assumption of costly information acquisition to the theory of mechanism design for matching allocation problems. It is shown that the assumption of endogenous information acquisition greatly changes some of the cherished results in that theory: in particular, the...

This article is concerned with the welfare properties of trade when the behavior of agents cannot be rationalized by preferences. I investigate this question in an environment of matching allocation problems. There are two reasons for doing so: firstly, the finiteness of such problems entails...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

The study of matching problems typically assumes that agents precisely know their preferences over the goods to be assigned. Within applied contexts, this assumption stands out as particularly counterfactual. Parents typically do invest a large amount of time and resources to find out which...

The undersupply of spots in German daycare facilities for toddlers challenges parents' possibilities to work. To ease the situation, the government implemented a new law entitling every child between ages one and three to daycare supervision for about four hours per day. Nevertheless, the...