Use this identifier to quote or link this document: http://hdl.handle.net/2072/1878

Bribe-proof rules in the division problem
Massó, Jordi; Neme, Alejandro
Universitat Autònoma de Barcelona. Unitat de Fonaments de l'Anàlisi Econòmica; Institut d'Anàlisi Econòmica
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.
2006-05-09
Economia matemàtica
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat, la unitat i l’institut i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/)
Working Paper
Working papers; 571.03
         

Full text files in this document

Files Size Format
57103.pdf 279.4 KB PDF

Show full item record

Related documents

Other documents of the same author

Berga, Dolors; Bergantiños Cid, Gustavo; Massó, Jordi; Neme, Alejandro
Berga, Dolors; Bergantiños Cid, Gustavo; Massó, Jordi; Neme, Alejandro
Barberà, Salvador, 1946-; Massó, Jordi; Neme, Alejandro
 

Coordination

 

Supporters