Bribe-proof rules in the division problem
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.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Schummer, James, 2000.
"Manipulation through Bribes,"
Journal of Economic Theory,
Elsevier, vol. 91(2), pages 180-198, April.
- Schummer, James & Thomson, William, 1997.
"Two derivations of the uniform rule and an application to bankruptcy,"
Elsevier, vol. 55(3), pages 333-337, September.
- Schummer, J. & Thomson, W., 1996. "Two Derivations of the Uniform Rule and an Application to Bankruptcy," RCER Working Papers 423, University of Rochester - Center for Economic Research (RCER).
- Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-19, March.
- Barbera, Salvador & Jackson, Matthew O. & Neme, Alejandro, 1997.
"Strategy-Proof Allotment Rules,"
Games and Economic Behavior,
Elsevier, vol. 18(1), pages 1-21, January.
- Gloria Fiestras-Janeiro & Flip Klijn & Estela S?chez, 2003.
"Manipulation of Optimal Matchings via Predonation of Endowment,"
UFAE and IAE Working Papers
561.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Fiestras-Janeiro, Gloria & Klijn, Flip & Sanchez, Estela, 2004. "Manipulation of optimal matchings via predonation of endowment," Mathematical Social Sciences, Elsevier, vol. 47(3), pages 295-312, May.
- Salvador Barberà, 2001. "An introduction to strategy-proof social choice functions," Social Choice and Welfare, Springer, vol. 18(4), pages 619-653.
- Masso, Jordi & Neme, Alejandro, 2007.
"Bribe-proof rules in the division problem,"
Games and Economic Behavior,
Elsevier, vol. 61(2), pages 331-343, November.
- Peter Eso & James Schummer, 2002.
"Bribing and Signalling in Second Price Auctions,"
1357, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Ching, Stephen, 1992. "A simple characterization of the uniform rule," Economics Letters, Elsevier, vol. 40(1), pages 57-60, September.
- Yves Sprumont, 1995. "Strategyproof Collective Choice in Economic and Political Environments," Canadian Journal of Economics, Canadian Economics Association, vol. 28(1), pages 68-107, February.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:61:y:2007:i:2:p:331-343. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.