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 beginning...

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

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 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...

In discrete exchange economies with possibly redundant and joint ownership, we propose new core notions in the conventional flavor by regarding endowments as rights to consume or trade with others. Our key idea is to identify self-enforcing coalitions and to redistribute their redundant property...

When allocating indivisible objects, agents might have equal priority rights for some objects. A common practice is to break the ties using a lottery and randomize over deterministic allocation mechanisms. Such randomizations usually lead to unfairness and inefficiency ex-ante. We propose a...

We consider house allocation problems (Shapley and Scarf, 1974) with strict preferences. We introduce a new axiom called pre-exchange-proofness, which states that no pair of agents gain by exchanging their endowments with each other prior to the operation of the chosen rule. We establish that a...

We study the implementation of social choice rules in environments with externalities. We prove the impossibility of implementing efficient and α-individually rational rules in dominant strategies. We prove that the α-core is implementable in Nash equilibrium under mild restrictions and it is...

We introduce and analyze an efficiency criterion for probabilistic assignment of objects, when only ordinal preference information is available. This efficiency criterion is based on the following domination relation: a probabilistic assignment dominates another assignment if it is ex-ante...