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

Which strategy-proof nonbossy mechanisms exist in a model with a finite number of indivisible goods (houses, jobs, positions) and a compensating perfectly divisible good (money)? The main finding is that only a finite number of distributions of the divisible good is consistent with...

This paper investigates the problem of allocating two types of indivisible objects among a group of agents when a priority-order must be respected and when only restricted monetary transfers are allowed. Since the existence of a fair allocation not generally is guaranteed due the the...

A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...

Public school systems generally use one of the three competing mechanisms – the Boston mechanism, the deferred acceptance mechanism and the top trading cycle mechanism – for assigning students to specific schools. Although the literature generally claims that the Boston mechanism is Pareto...

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

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

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 uses data consisting of students' strategically reported preferences and their underlying true preferences to study the course allocation mechanism used at Harvard Business School. We show that the mechanism is manipulable in theory, manipulated in practice, and that these...

We consider the problem of probabilistically allocating a single indivisible good among agents when monetary transfers are allowed. We construct a new strategy-proof rule, called the second price trading rule, and show that it is second best efficient. Furthermore, we give the second price...