Optimal Advertising for Information Products
Optimal Advertising for Information Products
复制标题
信息产品优化广告
DOI:
10.1145/3465456.3467649
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Chen, Yiling
中科院分区:
文献类型:
--
作者:
Zheng, Shuran;Chen, Yiling
When selling information products, sometimes the seller can provide some free partial information to change people's valuations so that the overall revenue can possibly be increased. In this work, we study the general problem of advertising information products by revealing partial information. We consider buyers who are decision-makers. The outcomes of the decision problems depend on the state of the world that is unknown to the buyers. The buyers can make their own observations and thus can hold different personal beliefs about the state of the world. There is an information seller who has access to the state of the world. The seller can promote the information by revealing some partial information. We assume that the seller chooses a long-term advertising strategy and then commits to it. The buyers decide whether to purchase the full information product after seeing the partial information. The seller's goal is to maximize the expected revenue. We study the problem in two settings. (1) The seller targets buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a simple function. The function is a product of two quantities. The first one is what we call the likelihood ratio, which depends on the buyer's personal belief about the state of the world. The second one is the cost of uncertainty, which represents the value of the information to the buyer. Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a finite-size convex program. The convex program will have a polynomial size if the state of the world has a constant number of possible realizations or the buyers face a decision problem with a constant number of options. For the general problem, we prove that it is NP-hard to find the optimal mechanism. (2) For the general problem when the seller faces buyers of different types and only knows the distribution of their types, we provide an approximation algorithm when it is not too hard to predict the possible type of buyers who will make the purchase. For the general problem, we prove that it is NP-hard to find a constant-factor approximation.
登录
查看更多内容
DOI:
10.2139/ssrn.3145000
发表时间:
2017-02
期刊:
ERN: Information Asymmetry Models (Topic)
影响因子:
--
作者:
D. Bergemann;S. Morris
通讯作者:
D. Bergemann;S. Morris
DOI:
--
发表时间:
2011
期刊:
影响因子:
--
作者:
M. Sarvary
通讯作者:
M. Sarvary
DOI:
--
发表时间:
2017
期刊:
SeCO Workshops
影响因子:
--
作者:
S. Dughmi
通讯作者:
S. Dughmi
DOI:
--
发表时间:
2020
期刊:
2020.
影响因子:
--
作者:
Yiling Chen, Haifeng Xu
通讯作者:
Yiling Chen, Haifeng Xu
DOI:
--
发表时间:
2015
期刊:
IEEE Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
Yu Cheng;Ho Yee Cheung;S. Dughmi;E. Emamjomeh;Lining Han;S. Teng
通讯作者:
S. Teng