机构:
Google Res, Mountain View, CA USAGoogle Res, Mountain View, CA USA
Alaei, Saeed
[1
]
Malekian, Azarakhsh
论文数: 0引用数: 0
h-index: 0
机构:
Univ Toronto, Toronto, ON M5S 1A1, CanadaGoogle Res, Mountain View, CA USA
Malekian, Azarakhsh
[2
]
Mostagir, Mohamed
论文数: 0引用数: 0
h-index: 0
机构:
Univ Michigan, Ann Arbor, MI 48109 USAGoogle Res, Mountain View, CA USA
Mostagir, Mohamed
[3
]
机构:
[1] Google Res, Mountain View, CA USA
[2] Univ Toronto, Toronto, ON M5S 1A1, Canada
[3] Univ Michigan, Ann Arbor, MI 48109 USA
来源:
EC'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON ECONOMICS AND COMPUTATION
|
2016年
关键词:
D O I:
10.1145/2940716.2940777
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Crowdfunding is quickly emerging as an alternative to traditional methods of funding new products. In a crowdfunding campaign, a seller solicits financial contributions from a crowd, usually in the form of pre-buying an unrealized product, and commits to producing the product if the total amount pledged is above a certain threshold. We provide a model of crowdfunding in which consumers arrive sequentially and make decisions about whether to pledge or not. Pledging is not costless, and hence consumers would prefer not to pledge if they think the campaign will not succeed. This can lead to cascades where a campaign fails to raise the required amount even though there are enough consumers who want the product. The paper introduces a novel stochastic process - anticipating random walks-to analyze this problem. The analysis helps explain why some campaigns fail and some do not, and provides guidelines about how sellers should design their campaigns in order to maximize their chances of success. More broadly, Anticipating Random Walks can also find application in settings where agents make decisions sequentially and these decisions are not just affected by past actions of others, but also by how they will impact the decisions of future actors as well.