
Designing rewards-based crowdfunding campaigns for strategic (but distracted) contributors
In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions.
Duke Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Published In
DOI
EISSN
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Logistics & Transportation
- 4901 Applied mathematics
- 3509 Transportation, logistics and supply chains
- 1503 Business and Management
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics
Citation

Published In
DOI
EISSN
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Logistics & Transportation
- 4901 Applied mathematics
- 3509 Transportation, logistics and supply chains
- 1503 Business and Management
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics