We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...

We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...

This paper considers a house allocation problem with no initial ownership and where prices are bounded from below and above by exogenously given price restrictions. This type of housing market contains, e.g., the "assignment market" and the "student placement problem" as special cases. A...

This paper considers a house allocation problem with no initial ownership and where prices are bounded from below and above by exogenously given price restrictions. This type of housing market contains, e.g., the "assignment market" and the "student placement problem" as special cases. A...

We examine a simple bargaining setting, where heterogeneous buyers and sellers are repeatedly matched with each other. We begin by characterizing efficiency in such a dynamic setting, and discuss how it differs from efficiency in a centralized static setting. We then study the allocations which...

In many organizations, members need to be assigned to certain positions, whether these are legislators to committees, executives to roles, or workers to teams. I show that these assignment problems lead to novel questions about institutional stability. Will the set of agents being assigned...

In many organizations, members need to be assigned to certain positions, whether these are legislators to committees, executives to roles, or workers to teams. I show that these assignment problems lead to novel questions about institutional stability. Will the set of agents being assigned...

We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in medicine and related subjects. This mechanism consists of three procedures based on final grades from school ("Abiturbestenverfahren", "Auswahlverfahren der Hochschulen") and on...

This paper analyses the efficiency of the equilibrium allocation in a matching model with two types of workers and jobs. The basic assumption is that high-skill workers can perform both skilled and unskilled jobs, while low-skill workers can only perform unskilled jobs. Our first result shows...

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of...