Research map / Bandits and online learning / Online convex optimization and games
Revenue Maximization Under Sequential Price Competition Via The Estimation Of $s$-Concave Demand Functions
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
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.87)
- Contextual Dynamic Pricing with Heterogeneous Buyers (NeurIPS 2025 · similarity 0.87)
- Dynamic Service Fee Pricing under Strategic Behavior: Actions as Instruments and Phase Transition (NeurIPS 2024 · similarity 0.87)
- Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand (NeurIPS 2026 · similarity 0.87)
- Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time (NeurIPS 2026 · similarity 0.87)
- Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shift (NeurIPS 2025 · similarity 0.86)
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.