Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shift
Yi Zhang, Elynn Chen, Yujun Yan

TL;DR
This paper introduces a novel transfer dynamic pricing algorithm that leverages auxiliary markets with structured preference shifts to achieve minimax-optimal regret, significantly improving learning speed and pricing accuracy.
Contribution
The paper presents CM-TDP, the first algorithm to handle structured model-shift transfer in dynamic pricing, with provable regret bounds for both linear and non-parametric utility models.
Findings
Achieves up to 50% lower cumulative regret in simulations.
Faster learning with up to 5 times improvement over single-market baselines.
Provides the first regret bounds for transfer pricing in RKHS settings.
Abstract
We study contextual dynamic pricing when a target market can leverage K auxiliary markets -- offline logs or concurrent streams -- whose mean utilities differ by a structured preference shift. We propose Cross-Market Transfer Dynamic Pricing (CM-TDP), the first algorithm that provably handles such model-shift transfer and delivers minimax-optimal regret for both linear and non-parametric utility models. For linear utilities of dimension d, where the difference between source- and target-task coefficients is -sparse, CM-TDP attains regret . For nonlinear demand residing in a reproducing kernel Hilbert space with effective dimension , complexity and task-similarity parameter , the regret becomes , matching…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
