Matching donations without crowding out? Some theoretical considerations, a field, and a lab experiment
Maja Adena () and
Steffen Huck ()
Journal of Public Economics, 2017, vol. 148, issue C, 32-42
Is there a way of matching donations that avoids crowding out? We introduce a novel matching method where the matched amount is allocated to a different project, present some simple theoretical considerations that predict reduced crowding out or crowding in (depending on the degree of substitutability between the two projects) and present evidence from a large-scale natural field experiment and a laboratory experiment. Similar to findings in the literature, conventional matching for the same project results in partial crowding out in the field experiment and, as predicted, crowding out is reduced under the novel matching scheme. The lab experiment provides more fine-tuned evidence for the change in crowding and yields further support for the theory: the novel matching method works best when the two projects are complements rather than substitutes.
Keywords: Charitable giving; Matched fundraising; Natural field experiment (search for similar items in EconPapers)
JEL-codes: C93 D12 D64 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
Working Paper: Matching donations without crowding out? Some theoretical considerations, a field, and a lab experiment (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:pubeco:v:148:y:2017:i:c:p:32-42
Access Statistics for this article
Journal of Public Economics is currently edited by R. Boadway and J. Poterba
More articles in Journal of Public Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().