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

There has been a surge of interest in stochastic assignment mechanisms which proved to be theoretically compelling thanks to their prominent welfare properties. Contrary to stochastic mechanisms, however, lottery mechanisms are commonly used for indivisible good allocation in real-life. To help...

We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...

Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate seats at oversubscribed courses. Bids play two key roles under these mechanisms to infer student preferences and to determine who have bigger claims on course seats. We show that these two roles may...

We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...

We revisit the classical object reallocation problem under strict preferences. When attention is constrained to the set of Pareto-efficient rules, it is known that TTC is the only rule that is strategyproof and individually-rational. We hence relax this constraint and consider pair-efficiency. A...