Research map / Bandits and online learning / Online convex optimization and games
Dynamic pricing and assortment under a contextual MNL demand
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
- Contextual Multinomial Logit Bandits with General Value Functions (NeurIPS 2024 · similarity 0.91)
- Dynamic Assortment Selection and Pricing with Censored Preference Feedback (ICLR 2025 · similarity 0.89)
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.88)
- Contextual Dynamic Pricing with Heterogeneous Buyers (NeurIPS 2025 · similarity 0.88)
- Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities (NeurIPS 2025 · similarity 0.88)
- Pricing with Contextual Elasticity and Heteroscedastic Valuation (ICML 2024 · similarity 0.87)
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.