资源受限动态定价的自适应推断
Adaptive Inference for Resource-Constrained Dynamic Pricing
Ruicheng Ao · Jiashuo Jiang · David Simchi-Levi
中文摘要
研究有限销售周期内的动态定价问题,其中有限资源容量决定收益,且推断仅基于预设价格下的观测。资源耗尽可能将目标邻域移出可行价格集,从而改变定价策略生成的实验。开发推断感知的重新求解控制器,在当前协变量到达前检查目标带可行性并记录定价混合。目标保留与平滑控制器将总体均值对几何作为部署前输入;学习重心重新求解则估计预声明分量核的平稳均值消耗向量。在仿射绑定容量族上,精确输入的目标保留控制器分配质量 $t^{-\gamma}$,以概率获得 $T^{1-\gamma}$ 阶信息时钟、$O_p\{T^{-(1-\gamma)/2}\}$ 半径,并在暴露面奖励恒等式下,有符号流体基准差距上界为 $O(\log T+T^{1-\gamma})$。在外生仿射面条件、预声明目标支撑及指数大于 1 的多项式误差支出下,学习重心重新求解以概率具有线性信息时钟和 $O(\log T)$ 有符号差距上界;中心局部定价在松弛容量和全局目标最优性下具有相同阶。无保留的精确输入、目标兼容平滑替代方案以概率给出线性时钟、$O_p(T^{-1/2})$ 确定性包络半径(无条件覆盖和报告概率趋于 1),以及 $O(\log^2 T)$ 有符号差距上界。边界结果展示了物理支撑何时丢失,以及为何 $1/t$ 目标分支若为唯一目标局部来源仅产生 $O_p(1)$ 信息。当预设支撑和信息条件成立时,策略报告区间,否则弃权。
关键要点
- 01资源耗尽会使目标邻域移出可行价格集,改变定价策略生成的实验。
- 02提出推断感知重新求解控制器,在协变量到达前检查目标带可行性并记录定价混合。
- 03精确输入目标保留控制器获得 $T^{1-\gamma}$ 阶信息时钟与 $O_p\{T^{-(1-\gamma)/2}\}$ 半径。
- 04学习重心重新求解在特定条件下具有线性信息时钟和 $O(\log T)$ 有符号差距上界。
- 05策略在预设支撑与信息条件成立时报告区间,否则弃权。
解读
尚无解读。
原始英文摘要
arXiv:2606.03736v4 Announce Type: replace Abstract: We study dynamic pricing over a finite selling horizon when limited resource capacity determines revenue and the observations available for inference at a prespecified price. Resource depletion can remove the target neighborhood from the feasible price set, changing the experiment generated by the pricing policy. We develop inference-aware re-solving controllers that check target-band feasibility before current covariates arrive and log the pricing mixture. Target-reserved and smooth controllers take population mean-pair geometry as a predeployment input; learned barycentric re-solving instead estimates stationary mean-consumption vectors of predeclared component kernels. On an affine binding-capacity family, an exact-input target-reserved controller assigning mass $t^{-\gamma}$ obtains an information clock of order $T^{1-\gamma}$ in probability, radius $O_p\{T^{-(1-\gamma)/2}\}$, and, under an exposed-face reward identity, a signed fluid-benchmark gap bounded above by $O(\log T+T^{1-\gamma})$. Under the exogenous affine-face condition, predeclared target support, and polynomial error spending with exponent greater than one, learned barycentric re-solving has a linear information clock in probability and an $O(\log T)$ signed-gap upper bound; centered local pricing has the same orders under slack capacity and global target optimality. An exact-input, target-compatible smooth alternative without reservation gives a linear clock in probability, an $O_p(T^{-1/2})$ deterministic-envelope radius with unconditional coverage and reporting probability tending to one, and an $O(\log^2 T)$ signed-gap upper bound. Boundary results show when physical support is lost and why a $1/t$ target branch yields only $O_p(1)$ information if it is the sole target-local source. The policy reports an interval when its prespecified support and information conditions hold and otherwise abstains.