Research map / Bandits and online learning / Online convex optimization and games
No-regret Learning in Price Competitions under Consumer Reference Effects
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
- No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand (NeurIPS 2023 · similarity 0.93)
- Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners (ICML 2026 · similarity 0.89)
- Explaining the Law of Supply and Demand via Online Learning (NeurIPS 2025 · similarity 0.89)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.86)
- Online Learning in Betting Markets: Profit versus Prediction (ICML 2024 · similarity 0.86)
- Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility (AAAI 2024 · 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.