We study resource allocation with multi-unit demand, such as the allocation of courses to students. In contrast to the case of single-unit demand, no stable mechanism, not even the (student-proposing) deferred acceptance algorithm, achieves desirable properties: it is not strategy-proof and the...

This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their...

We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable...

An apex game consists of one apex player and a set of minor players. We identify two key properties of apex games and use them to introduce the class of general apex games. We derive players' preferences over winning coalitions by applying strongly monotonic power indices on such a game and all...

First via a counter example it is shown that Proposition 3 of Anbarci and Sun (2013) is false. Then a gap and a mistake in their proof are identified. Finally, a modified version of their Proposition 3 is stated and proved.

A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation. Based on this insight, we formulate the...

In 1985 Aumann axiomatized the Shapley NTU value by non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives. We show that, when replacing unanimity by “unanimity for the grand coalition” and translation covariance, these...

We analyze absorbing sets as a solution for roommate problems with strict preferences. This solution provides the set of stable matchings when it is non-empty and some matchings with interesting properties otherwise. In particular, all matchings in an absorbing set have the greatest number of...