Essential characteristics of corruption are (1) reciprocity relationships between bribers and public officials, (2) negative welfare effects, and (3) high penalties when discovered. We separate the influences of these factors in an experiment. In a two-player game, reciprocation is economically inefficient through negative externalities. A control treatment without externalities is also conducted. In a third, so-called sudden death treatment, corrupt pairs face a low probability of exclusion from the experiment without payment. The results show that reciprocity can establish bribery relationships, where negative externalities have no apparent effect. The penalty threat significantly reduces corruption, although discovery probabilities are typically underestimated. Copyright 2002, Oxford University Press.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Volume (Year): 18 (2002) Issue (Month): 2 (October) Pages: 428-454 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Contact details of provider: Postal: Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK Fax: 01865 267 985 Email: Web page: http://jleo.oupjournals.org/
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).
Related research
Keywords:
Cited by: (explanations, 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.)
Klaus Abbink & Matthew Ellman, 2004.
"The Donor Problem,"
Economics Working Papers
796, Department of Economics and Business, Universitat Pompeu Fabra, revised Jan 2005.
[Downloadable!]
Did you know? You can create a compilation of all publications of a group of people, say alumni of a program, your students or memers of an association.