guest ::
| Home > Research literature > Working papers > Bribe-proof rules in the division problem |
| Home > Research literature > Working papers > Bribe-proof rules in the division problem |
| Date: | 2006 |
| Description: | 21 p. |
| 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. |
| Rights: | Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.  |
| Language: | Anglès |
| Series: | Departament d'Economia i d'Història Econòmica. Unitat de Fonaments de l'Anàlisi Econòmica / Institut d'Anàlisi Econòmica (CSIC). Working papers |
| Series: | Working papers ; 571.03 |
| Document: | Working paper |
| Subject: | Economia matemàtica |
