Beyond Advertising: Mechanism Design for Platform-Wide Marketing Service "QuanZhanTui"
Ningyuan Li, Zhilin Zhang, Tianyan Long, Yuyao Liu, Rongquan Bai, Yurong Chen, Xiaotie Deng, Pengjie Wang, Chuan Yu, Jian Xu, Bo Zheng
Abstract
On e-commerce platforms, sellers typically bid for impressions from ad traffic to promote their products. However, for most sellers, the majority of their sales come from organic traffic. Consequently, the relationship between their ad spending and total sales remains uncertain, resulting in operational inefficiency. To address this issue, e-commerce platforms have recently introduced a novel platform-wide marketing service known as QuanZhanTui, which has reportedly enhanced marketing efficiency for sellers and driven substantial revenue growth for platforms. QuanZhanTui allows sellers to bid for impressions from the platform's entire traffic to boost their total sales without compromising the platform's user experience. In this paper, we investigate the mechanism design problem that arises from QuanZhanTui. The problem is formulated as a multi-objective optimization to balance sellers' welfare and platform's user experience. We first introduce the stock-constrained value maximizer model, which reflects sellers' dual requirements on marketing efficiency and platform-wide ROI. Then, we propose the Liquid Payment Auction (LPA), an auction designed to optimize the balanced objectives while accounting for sellers' requirements in the auto-bidding environment. It employs a simple payment rule based on sellers' liquid welfare, providing a clearer link between their investment and total sales. Under mild assumptions, we theoretically prove desirable properties of LPA, such as optimality and incentive compatibility. Extensive experiments demonstrate LPA's superior performance over conventional auctions in QuanZhanTui.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e24261cb-9b86-4bb3-a222-851cae5ad4afCited by top-tier papers1
Ask how each one uses itBuilds on10
- Dual Mirror Descent for Online Allocation ProblemsSantiago R. Balseiro, Haihao Lu, Vahab S. MirrokniICML 2020 · 102 citations
- Towards Efficient Auctions in an Auto-bidding WorldYuan Deng, Jieming Mao, Vahab S. Mirrokni, Song ZuoWWW 2021 · 87 citations
- Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCGAranyak MehtaWWW 2022 · 41 citations
- Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱Zhe Feng, Swati Padmanabhan, Di WangWWW 2023 · 38 citations
- Online Learning under Budget and ROI Constraints via Weak AdaptivityMatteo Castiglioni, Andrea Celli, Christian KroerICML 2024 · 12 citations
Related papers
- Utility Maximizer or Value Maximizer: Mechanism Design for Mixed Bidders in Online AdvertisingHongtao Lv, Zhilin Zhang, Zhenzhe Zheng, Jinghan Liu et al.AAAI 2023 · 10 citations
- Strategic Budget Selection in a Competitive Autobidding WorldYiding Feng, Brendan Lucier, Aleksandrs SlivkinsSTOC 2024 · 2 citations
- Cross DQN: Cross Deep Q Network for Ads Allocation in FeedGuogang Liao, Ze Wang, Xiaoxu Wu, Xiaowen Shi et al.WWW 2022 · 46 citations
- A Context-Aware Framework for Integrating Ad Auctions and RecommendationsYuchao Ma, Weian Li, Yuejia Dou, Zhiyuan Su et al.WWW 2025 · 3 citations
- Ad Auction Design with Coupon-Dependent Conversion Rate in the Auto-bidding WorldBonan Ni, Xun Wang, Qi Zhang, Pingzhong Tang et al.WWW 2023 · 3 citations
