Trading Discount for Reputation?: On the Design and Analysis of E-Commerce Discount Mechanisms
暂无分享,去创建一个
We develop an optimization framework to trade short-term profits for reputation (i.e., reducing ramp-up time). We apply the stochastic bandits framework to design an online discounting mechanism which infers the optimal discount from a seller's historical transaction data. We conduct experiments on an eBay's dataset and show that our online discounting mechanism can trade 60% of the shortterm profits for reducing the ramp-up time by 40%.
[1] Angelos Stavrou,et al. E-commerce Reputation Manipulation: The Emergence of Reputation-Escalation-as-a-Service , 2015, WWW.
[2] Paul Resnick,et al. Reputation systems , 2000, CACM.
[3] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[4] John C. S. Lui,et al. Modeling eBay-like reputation systems: Analysis, characterization and insurance mechanism design , 2015, Perform. Evaluation.