Bribe-proof rules in the Division Problem

MASSÓ J., NEME A.

Bahia Blanca

Congreso; XXXII Reunión anual de la Asociación Argentina de Economía Política; 2007

Asociación Argentina de Economía Política-Universidad Nacional del Sur

Abstract: The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.