Strategic Online Information Disclosure in Crowdfunding

In crowdfunding, a project creator maximizes revenue by jointly optimizing information disclosure and pricing strategies for contributors who arrive stochastically. Such a joint optimization problem is challenging to solve due to its online nature and intertwined strategies. Nevertheless, we propose an online algorithm (with low computational complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathcal{O}\left(N_{\textit{max}}^{2}\right)$</tex>) to address the problem in two steps. First, we show that it is optimal for the creator to charge the same price between two consecutive information disclosure instances. Second, we prove that a creator only needs to consider whether to disclose information immediately after a contributor arrives. We show that the creator increases the price as the campaign processes, which is consistent with the common observation. Our mechanism numerically outperforms the popular information disclosure policy used by leading platforms like Kickstarter and Indiegogo, yielding an average revenue gain of 150%.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11162080
Primary Topic
FinTech, Crowdfunding, Digital Finance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strategic Online Information Disclosure in Crowdfunding

Qi Shao, Man Hon Cheung, Jianwei Huang
FinTech, Crowdfunding, Digital Finance
article

Strategic Online Information Disclosure in Crowdfunding

Qi Shao, Man Hon Cheung, Jianwei Huang
article en

Abstract

In crowdfunding, a project creator maximizes revenue by jointly optimizing information disclosure and pricing strategies for contributors who arrive stochastically. Such a joint optimization problem is challenging to solve due to its online nature and intertwined strategies. Nevertheless, we propose an online algorithm (with low computational complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathcal{O}\left(N_{\textit{max}}^{2}\right)$</tex>) to address the problem in two steps. First, we show that it is optimal for the creator to charge the same price between two consecutive information disclosure instances. Second, we prove that a creator only needs to consider whether to disclose information immediately after a contributor arrives. We show that the creator increases the price as the campaign processes, which is consistent with the common observation. Our mechanism numerically outperforms the popular information disclosure policy used by leading platforms like Kickstarter and Indiegogo, yielding an average revenue gain of 150%.

City University of Hong Kong (HK), Chinese University of Hong Kong (HK), Chinese University of Hong Kong, Shenzhen (CN)
Openalex Percentile: Top 57%
FinTech, Crowdfunding, Digital Finance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.