Learning to Price with Persuasion
Not on the map. Why?
Abstract (arXiv)
Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves information and mechanism design. Specifically, we consider the economic setting recently introduced by Bergemann et al. (2022), where in addition to the menu of quality-price pairs, the seller offers information on the value of the match between product quality and buyer's taste via a signaling scheme. We relax the assumption that the seller knows the buyers' belief about the distribution of tastes and study the sample requirements of designing a revenue maximizing scheme. We consider both the batch setting where we have access to data from a set of i.i.d. buyers and an online demand query model where we observe the buyers' behaviors to seller's schemes. Despite the apparent non-convexity of the problem, we also give the first FPTAS to compute a scheme that maximizes the revenue within an arbitrarily small additive loss, which was left open by Bergemann et al. (2022). Overall, this brings a new learning perspective in asymmetric economic settings where buyers and sellers know different types of information.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 51 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
15 of 51 references.
References · 15
- 2015The Sample Complexity of Revenue Maximizationcited by 48
- 2016Sample Complexity of Automated Mechanism Designcited by 24
- 2019Settling the Sample Complexity of Single-parameter Revenue Maximizationcited by 24
- 2016Learning Simple Auctionscited by 23
- 2015Ironing in the Darkcited by 13
- 2021Learning to Persuade on the Fly: Robustness Against Ignorancecited by 12
- 2021Multi-Receiver Online Bayesian Persuasioncited by 12
- 2017Generalization Guarantees for Multi-item Profit Maximization: Pricing, Auctions, and Randomized Mechanismscited by 11
- 2025Nearly-Optimal Bandit Learning in Stackelberg Games with Side Informationcited by 6
- 2020How to Sell Information Optimally: an Algorithmic Studycited by 5
- 2021Regret-Minimizing Bayesian Persuasioncited by 5
- 2024Online Bayesian Persuasion Without a Cluecited by 5
3 more
Built on by
Not cited yet.