Newshot

The Value of Information in Resource-Constrained Pricing

Summary

arXiv:2603.24974v3 Announce Type: replace-cross Abstract: 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 co…

Original text(via arXiv stat.ML)

Mathematics > Optimization and Control

Title:The Value of Information in Resource-Constrained Pricing

Abstract: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.
Comments:90 pages
Subjects:Optimization and Control (math.OC) ; Machine Learning (cs.LG); Machine Learning (stat.ML)
Cite as:arXiv:2603.24974 [math.OC]
(or arXiv:2603.24974v3 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2603.24974 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv stat.ML
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗