Research map / Bandits and online learning / Online convex optimization and games
Online Inventory Optimization in Non-Stationary Environment
Koji Ichikawa, Kei Takemura, Tatsuya Matsuoka
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Optimal Hidden-Target Learning for Online Inventory Optimization on General Convex Sets (NeurIPS 2026 · similarity 0.92)
- Adaptive Market Making with Inventory Constraints via Online Learning (AAAI 2025 · similarity 0.86)
- An Equivalence Between Static and Dynamic Regret Minimization (NeurIPS 2024 · similarity 0.85)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.85)
- Online Allocation with Unknown Shared Supply (NeurIPS 2026 · similarity 0.85)
- Non-stationary Online Convex Optimization with Arbitrary Delays (ICML 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
