Manipulation Through Bribes
AbstractWe consider allocation rules that choose both a public outcome and transfers, based on the agents' reported valuations of the outcomes. Under a given allocation rule, a bribing situation exists when one agent could pay another to misreport his valuations, resulting in a net gain to both agents. A rule is bribe-proof if such opportunities never arise (including the case in which the briber and bribee are the same agent). The central result is that under a bribe-proof rule, regardless of the domain of admissible valuations, the payoff to any one agent is a continuous function of any other agent's reported valuations. We then show that on connected domains of valuation functions, if either the set of outcomes is finite or each agent's set of admissible valuations is smoothly connected, then an agent's payoff is a constant function of other agents' reported valuations. Finally, under the additional assumption of a standard richness condition on the set of admissible valuations, a bribe-proof rule must be a constant function.
Download InfoIf 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.
Bibliographic InfoPaper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1207.
Date of creation: Jun 1997
Date of revision:
Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
Other versions of this item:
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. "Eliciting Preferences to Assign Positions and Compensation," Games and Economic Behavior, Elsevier, vol. 30(2), pages 293-318, February.
- Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-38, March.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- G. Chichilnisky & G. M. Heal, 1997.
"The geometry of implementation: a necessary and sufficient condition for straightforward games (*),"
Social Choice and Welfare,
Springer, vol. 14(2), pages 259-294.
- Heal, G.M. & Chichilnisky, G., 1995. "The Geometry of Implementation: A Necessary and Sufficient Condition for Straightforward Games," Papers 95-22, Columbia - Graduate School of Business.
- Cremer, Jacques, 1996. "Manipulations by Coalitions Under Asymmetric Information: The Case of Groves Mechanisms," Games and Economic Behavior, Elsevier, vol. 13(1), pages 39-73, March.
- Barbera, Salvador & Jackson, Matthew O, 1995.
Econometric Society, vol. 63(1), pages 51-87, January.
- Green, Jerry & Laffont, Jean-Jacques, 1979. "On Coalition Incentive Compatibility," Review of Economic Studies, Wiley Blackwell, vol. 46(2), pages 243-54, April.
- Jordi MassóAuthor-Email: email@example.com & 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).
- Sertel, Murat R. & Ozkal-Sanver, Ipek, 2002.
"Manipulability of the men- (women-) optimal matching rule via endowments,"
Mathematical Social Sciences,
Elsevier, vol. 44(1), pages 65-83, September.
- Murat Sertel, 2000. "Manipulability of the Men-(Women) Optimal Matching Rule via Endowments," Departmental Working Papers 0014, Bilkent University, Department of Economics.
- Salvador Barberà, 2010.
"Strategy-proof social choice,"
420, Barcelona Graduate School of Economics.
- Shigehiro Serizawa, 2005.
"Pairwise Strategy-Proofness and Self-Enforcing Manipulation,"
ISER Discussion Paper
0629, Institute of Social and Economic Research, Osaka University.
- Shigehiro Serizawa, 2006. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," Social Choice and Welfare, Springer, vol. 26(2), pages 305-331, April.
- Eso, Peter & Schummer, James, 2004.
"Bribing and signaling in second price auctions,"
Games and Economic Behavior,
Elsevier, vol. 47(2), pages 299-324, May.
- 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.
- Fujinaka, Yuji & Wakayama, Takuma, 2008.
"Secure implementation in economies with indivisible objects and money,"
Elsevier, vol. 100(1), pages 91-95, July.
- Yuji Fujinaka & Takuma Wakayama, 2007. "Secure Implementation in Economies with Indivisible Objects and Money," ISER Discussion Paper 0699, Institute of Social and Economic Research, Osaka University.
- Sato, Shin, 2013. "A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one," Journal of Economic Theory, Elsevier, vol. 148(1), pages 259-278.
- Chen, Jing & Micali, Silvio, 2012. "Collusive dominant-strategy truthfulness," Journal of Economic Theory, Elsevier, vol. 147(3), pages 1300-1312.
- Mizukami, Hideki & Wakayama, Takuma, 2009. "The relation between non-bossiness and monotonicity," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 256-264, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker).
If references are entirely missing, you can add them using this form.