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 provides three short proofs of the classical Gibbard–Satterthwaite theorem. The theorem is first proved in the case with only two voters. The general case follows then from an induction argument over the number of voters. The proof of the theorem is further simplified when the...

We consider an allocation problem with a finite number of objects, and agents that demand at most one of the objects. The study provides a characterization of a class of strategy-proof price mechanisms. A mechanism belongs to the class if and only if the price space is restricted in a special...