원문 초록
Dynamic pricing with resource constraints requires balancing exploration of unknown demand patterns against exploitation of known information to maximize revenue. We develop algorithms for this problem across different information regimes. Products share perishable resources, and the firm posts prices and observes the realized requests, which may exceed the remaining capacity. In the full-information setting, a residual-correction policy that solves the fluid problem once attains $O(\log T)$ regret with bounded prices and arbitrary-rank resource matrices. In the no-information setting, deterministic exploration followed by a certainty-equivalent policy attains $O(\sqrt T)$ regret when the limiting fluid solution is nondegenerate. In the informed-price setting, given an initial price-demand estimate, a feedback controller learns the implementing prices without estimating the slope matrix if the slope matrix is symmetric, a set containing it is known in advance, the informed price is aligned with the resource constraints, and an inverse-image condition holds. A selector chooses between the informed-price algorithm and the no-information algorithm from historical data. Its regret bound includes observation error, misalignment, inventory exits, and periods on the fixed price. We further show how offline surrogate models reduce the regret of the learning policy through variance reduction, even when misspecified. The bound includes calibration and screen failures, and the regret is reduced for all sufficiently large horizons. We finally demonstrate the empirical performances of our policies through complete numerical experiments.
제출 이력
확인된 버전만 표시합니다. 전체 제출 이력은 arXiv 원문에서 확인하세요.
- arXiv:2603.24974v3제출 시각 미확인
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
공통 태그로 연결된 공개 논문이 아직 없습니다.
토론
이 논문과 연결된 포럼 글이 아직 없습니다.