Advanced Search
MyIDEAS: Login to save this paper or follow this series

Bribe-proof Rules in the Division Problem

Contents:

Author Info

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.

Download Info

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.
File URL: http://pareto.uab.es/wp/2003/57103.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC) in its series UFAE and IAE Working Papers with number 571.03.

as in new window
Length: 21
Date of creation: 07 May 2003
Date of revision:
Handle: RePEc:aub:autbar:571.03

Contact details of provider:
Postal: 08193, Bellaterra, Barcelona
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Email:
Web page: http://pareto.uab.cat
More information through EDIRC

Related research

Keywords: Bribe-proofness; Strategy-proofness; Efficiency; Replacement Monotonicity; Single-peakedness;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Masso, Jordi & Neme, Alejandro, 2007. "Bribe-proof rules in the division problem," Games and Economic Behavior, Elsevier, vol. 61(2), pages 331-343, November.
  2. 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).
  3. Schummer, James, 2000. "Manipulation through Bribes," Journal of Economic Theory, Elsevier, vol. 91(2), pages 180-198, April.
  4. Ching, Stephen, 1992. "A simple characterization of the uniform rule," Economics Letters, Elsevier, vol. 40(1), pages 57-60, September.
  5. Eso, Peter & Schummer, James, 2004. "Bribing and signaling in second price auctions," Games and Economic Behavior, Elsevier, vol. 47(2), pages 299-324, May.
  6. 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).
  7. 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.
  8. 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.
  9. Salvador Barberà, 2001. "An introduction to strategy-proof social choice functions," Social Choice and Welfare, Springer, vol. 18(4), pages 619-653.
  10. H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
  11. Barbera, Salvador & Jackson, Matthew O. & Neme, Alejandro, 1997. "Strategy-Proof Allotment Rules," Games and Economic Behavior, Elsevier, vol. 18(1), pages 1-21, January.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Jordi MassóAuthor-Email: jordi.masso@uab.es & Alejandro Neme, 2003. "Bribe-proof Rules in the Division Problem," UFAE and IAE Working Papers 571.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  2. 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.
  3. Kentaro Hatsumi & Shigehiro Serizawa, 2009. "Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods," Social Choice and Welfare, Springer, vol. 33(3), pages 423-447, September.
  4. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
  5. Szwagrzak, Karol, 2014. "Strategy-proof market clearing mechanisms," Discussion Papers of Business and Economics 4/2014, Department of Business and Economics, University of Southern Denmark.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:aub:autbar:571.03. 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: (Xavier Vila).

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.