Research map / Bandits and online learning / Online convex optimization and games
Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions
Read the paperCheck your idea against 108,967 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
- Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem (AAAI 2024 · similarity 0.90)
- Learning-Augmented Algorithms for the Bahncard Problem (NeurIPS 2024 · similarity 0.87)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.86)
- Online Resource Allocation With General Constraints (NeurIPS 2026 · similarity 0.86)
- Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods (ICML 2024 · similarity 0.86)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.85)
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.