Skip to content
Preprint

Learning to Price with Persuasion

Aug 2026 · 0 citations · 51 references
Computer Science Economics

TL;DR

This work considers 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 and gives the first FPTAS to compute a scheme that maximizes the revenue within an arbitrarily small additive loss.

Abstract

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.

View source

Similar papers

ECON tribute

Francesc Dilmé · 0 citations
Preprint Sep 2026

Auctions with Price Predictions

We design auctions for the sale of a single item with unlimited supply given a single prediction of the revenue-maximizing uniform price. This departs from prior work on auctions with predictions which typically assumes predictions of every bidder's value. Our main result is a characterization of the Pareto frontier fo...

Muthu Sundar, Alec Sun, Siddharth Prasad et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Learnable Randomization as Commitment Against Adaptive Optimizers

This work studies unpredictable near-optimal policies (UNOP), which mix uniformly on near-best actions that remain individually rational and which can be learned and the optimizer can match its best response, while the user's payoff stays higher because the mixture changes which action is targeted.

Zi-Han Deng, Chuanzhi Xu, Xiao-Zhen Zhong et al. · 0 citations
Preprint Sep 2026

Optimal Prophet Inequalities for Gain from Trade

We initiate the study of prophet trading, an online trading model in which a trader interacts with sellers and buyers who arrive in a uniformly random order and whose prices are drawn independently from a common known distribution. The trader aims to maximize the expected gain from trade (GFT), with performance measure...

Xu-Jin Chen, Xiao-Dong Hu, Chang-Jun Wang et al. · 0 citations
Preprint Sep 2026

Non-Linear Pricing Restores Tractability for a Data Seller

We consider a data seller who designs pricing mechanisms over multiple datasets to maximize revenue from budget-constrained buyers. The seller offers multiple datasets and assigns each a pricing function that maps the quantity purchased to a total payment. The goal is to design these pricing functions to maximize reven...

B. Chaudhury, Jugal Garg, Eklavya Sharma et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.