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 envy-free and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In finite economies, we identify under classical preferences each agent’s maximal gain from manipulation. Using this...

We extend the Shapley-Scarf (1974) model - where a finite number of indivisible objects is to be allocated among a finite number of individuals - to the case where the primary endowment set of an individual may contain none, one, or several objects and where property rights may be transferred...

This paper investigates an allocation rule that fairly assigns at most one indivisible object and a monetary compensation to each agent, under the restriction that the monetary compensations do not exceed some exogenously given upper bound. A few properties of this allocation rule are stated and...