Dynamic Pricing and Learning with Bayesian Persuasion
Shipra Agrawal, Yiding Feng, Wei Tang
Abstract
We consider a novel pricing and advertising framework, where a seller not only sets product price but also designs flexible 'advertising schemes' to influence customers' valuation of the product. We impose no structural restriction on the seller's feasible advertising strategies and allow her to advertise the product by disclosing or concealing any information. Following the literature in information design, this fully flexible advertising can be modeled as the seller being able to choose any information policy that signals the product quality/characteristic to the customers. Customers observe the advertising signal and infer a Bayesian belief over the products. We aim to investigate two questions in this work: (1) What is the value of advertising? To what extent can advertising enhance a seller's revenue? (2) Without any apriori knowledge of the customers' demand function, how can a seller adaptively learn and optimize both pricing and advertising strategies using past purchase responses? To study the first question, we introduce and study the value of advertising -a revenue gap between using advertising vs not advertising, and we provide a crisp tight characterization for this notion for a broad family of problems. For the second question, we study the seller's dynamic pricing and advertising problem with demand uncertainty. Our main result for this question is a computationally efficient online algorithm that achieves an optimal O(T 2 /3 (m log T ) 1 /3 ) regret rate when the valuation function is linear in the product quality. Here m is the cardinality of the discrete product quality domain and T is the time horizon. This result requires some mild regularity assumptions on the valuation function, but no Lipschitz or smoothness assumption on the customers' demand function. We also obtain several improved results for the widely considered special case of additive valuations. 1
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 6fe76a97-ca07-4c8d-8f9d-1cf76a6fa579Cited by top-tier papers3
- Online Bayesian Persuasion Without a ClueFrancesco Bacchiocchi, Matteo Bollini, Matteo Castiglioni, Alberto Marchesi et al.NeurIPS 2024 · 9 citations
- Steering the Herd: A Framework for LLM-based Control of Social LearningRaghu Arghal, Kevin He, Shirin Saeedi Bidokhti, Saswati SarkarICLR 2026 · 1 citation
- Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information AcquisitionZichen Wang, Chuanhao Li, Huazheng WangICML 2025
Builds on1
Related papers
- Prior-independent Dynamic Auctions for a Value-maximizing BuyerYuan Deng, Hanrui ZhangNeurIPS 2021 · 8 citations
- Improved Online Learning Algorithms for CTR Prediction in Ad AuctionsZhe Feng, Christopher Liaw, Zixin ZhouICML 2023 · 9 citations
- Improved Algorithms for Contextual Dynamic PricingMatilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney PerchetNeurIPS 2024 · 18 citations
- Online Bayesian PersuasionMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola GattiNeurIPS 2020 · 26 citations
- Online Pricing with Limited Supply and Time-Sensitive ValuationsShaoang Li, Lan Zhang, Xiang-Yang LiINFOCOM 2022 · 7 citations
