conftrace_

dynamic pricing

40 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) online algorithm (445) multi-armed bandit (1098) revenue optimization (63) regret minimization (315) mechanism design (340) demand model (3) contextual bandit (381) markov decision process (790)

Papers

Pricing Online LLM Services with Data-Calibrated Stackelberg Routing Game AAAI 2026
Safe dynamic pricing for nonstationary network resource allocation L4DC 2024
Smoothness-Adaptive Dynamic Pricing with Nonparametric Demand Learning AISTATS 2024
Improved Algorithms for Contextual Dynamic Pricing NIPS 2024
Learning with Posterior Sampling for Revenue Management under Time-varying Demand IJCAI 2024
Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model JMLR 2024
Dynamic Service Fee Pricing under Strategic Behavior: Actions as Instruments and Phase Transition NIPS 2024
FairPlay: A Multi-Sided Fair Dynamic Pricing Policy for Hotels AAAI 2024
Incentive-aware Contextual Pricing with Non-parametric Market Noise AISTATS 2023
Dynamic Pricing and Learning with Bayesian Persuasion NIPS 2023
Doubly Fair Dynamic Pricing AISTATS 2023
Dynamic Pricing with Volume Discounts in Online Settings AAAI 2023
Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise AISTATS 2022
Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards ICML 2022
Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms IJCAI 2022
Dynamic pricing and assortment under a contextual MNL demand NIPS 2022
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model NIPS 2022
Context-Based Dynamic Pricing with Partially Linear Demand Model NIPS 2022
Logarithmic Regret in Feature-based Dynamic Pricing NIPS 2021
Prior-independent Dynamic Auctions for a Value-maximizing Buyer NIPS 2021
Multi-armed Bandit Requiring Monotone Arm Sequences NIPS 2021
Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021
Learning to Price Against a Moving Target ICML 2021
When Demands Evolve Larger and Noisier: Learning and Earning in a Growing Environment ICML 2020
Reinforcement Mechanism Design: With Applications to Dynamic Pricing in Sponsored Search Auctions AAAI 2020