AI & ML
The Value of Information in Resource-Constrained Pricing
arXiv stat.ML0 views
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 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.
Source:https://arxiv.org/abs/2603.24974PreviousOn the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial CoverageNextAsymmetric Transistor Aging Under Thermal Gradients
Related posts
If you can't explain something in simple terms, you don't understand it (2017)
0Hacker News
The AI free tier is shrinking: five tools that changed pricing in 2026
0dev.to

Hyphen vs En Dash vs Em Dash: Differences, Examples, and When to Use Each
0dev.to
Running Whisper in the browser: 5 decisions behind a no-upload, no-cap transcriber
0dev.to

Mastering Agentic KV Caching: How to Slash LLM Agent Latency and Costs
0dev.to
![Robot Foundation Models and VLA — Ch.03: Vision Language Models for Robotics [EN]](https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fmezw012qznfr1y0dyk0f.png)
Robot Foundation Models and VLA — Ch.03: Vision Language Models for Robotics [EN]
0dev.to