跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1814新增论文
+1519其中 AI 相关
+88已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-06 02:51 · 全站最近入库:2026-11-05 12:13各信源进度 →

统计口径与数据新鲜度

统计 2026-11-05 03:32 — 2026-11-06 03:32(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-06 02:51最近发现新增版本:2026-11-05 12:13库内论文最新更新时间:2026-11-05 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

15,949 已收录论文13,765 AI 相关3,571 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-06 02:49(北京时间)
版本更新 · v2arXiv:2610.22516

SALE: Source-Aware Dynamic Pricing with Strategic Buyers

Jinjiang Zou, Yang Li, Zemin Zheng

In modern commerce, firms and platforms typically use customer features from different sources to personalize prices: some features are verified using seller records or third-party data, while others are self-reported and may be strategically manipulated by buyers seeking lower prices. In this paper, we study the problem of source-aware dynamic pricing with strategic buyers, where the buyer's valuation is a sparse linear function of her high-dimensional features plus market noise with an unknown distribution. We develop the Source-Aware Localized exploration and calibrated Exploitation (SALE) policy, which personalizes exploration using past learning and verified features, and corrects for strategic manipulation using verified and reported features during exploitation. Our novel personalized design aims to narrow the range of prices explored, reducing unnecessary exploration at excessively high or low prices. To support learning under this design, we derive a new population equation that enables sparse valuation parameter estimation and, in turn, nonparametric estimation of the unknown noise distribution, even when buyer features are dependent over time. By uncovering the intrinsic sparse structure, our analysis establishes estimation guarantees for both learning tasks using the same exploration data. With these guarantees, we show that SALE achieves a sublinear expected regret bound, explicitly quantifying the benefit of using verified features to narrow exploration intervals. Several numerical studies further demonstrate the appealing performance of SALE.

尚无 AI 解读,展示原文摘要

stat.ML · cs.LG · stat.ME
arXiv ↗PDF ↗