# Online Inventory Optimization on Adversarial Demand Static Setting Source: [Online Inventory Optimization on Adversarial Demand Static Setting]() Collection index: [llms.txt]() Data updated: 2026-06-15T08:08:51.224Z Evaluation of Online Inventory Optimization algorithms under adversarial demand conditions, measured by theoretical performance bounds (Upper Bound and Lower Bound). A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage. | Scope | Recorded value | | --- | --- | | Task | Online Inventory Optimization | | Dataset (including any stated split) | Adversarial-demand Online Inventory Optimization Static | | Metric | Upper Bound | | Unit | SCALAR | | Direction | Lower is better | | Results loaded | 1 of 1 | | Coverage | All results currently returned for this benchmark | Evaluation settings may differ between results. The original papers and recorded configurations are needed to establish comparability. A shared metric name alone does not establish an identical protocol. ## Metrics - [Upper Bound](): Lower is better; unit: SCALAR. - [Lower Bound](): Lower is better; unit: SCALAR. ## Recorded results | Method | Upper Bound | Result date | Report paper | | --- | --- | --- | --- | | HT (Ichikawa et al., 2026) | 1 | Not recorded | 6a2f873ed33dfb23e783c1c3 | ### HT (Ichikawa et al., 2026) Upper Bound: 1. Result ID: 6a2fb1d8fbc373592c2bdf86. [Reporting paper]() Recorded evaluation configuration: {"Capacity Set":"linear","Demand Primitive":"sell-out period Lmax","Loss Convexity":"convex"}. This record does not assert independent reproduction. Page 1 of 1. This is an index page, not the full collection.