mlsanityData to 7 Oct 2026

Non-Stationary Dynamic Pricing Via Actor-Critic Information-Directed Pricing

arXiv 2208.09372 ↗First posted 19 Aug 2022stat.ML cs.LG econ.GNcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper presents a novel non-stationary dynamic pricing algorithm design, where pricing agents face incomplete demand information and market environment shifts. The agents run price experiments to learn about each product's demand curve and the profit-maximizing price, while being aware of market environment shifts to avoid high opportunity costs from offering sub-optimal prices. The proposed ACIDP extends information-directed sampling (IDS) algorithms from statistical machine learning to include microeconomic choice theory, with a novel pricing strategy auditing procedure to escape sub-optimal pricing after market environment shift. The proposed ACIDP outperforms competing bandit algorithms including Upper Confidence Bound (UCB) and Thompson sampling (TS) in a series of market environment shifts.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 28 references that are in the map. First posted on arXiv 19 Aug 2022.

Builds on

10 of 28 references.

References · 10

  1. 2013Learning to Optimize Via Posterior Samplingcited by 253
  2. 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 220
  3. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  4. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  5. 2020Information Directed Sampling for Linear Partial Monitoringcited by 39
  6. 2020Asymptotically Optimal Information-Directed Samplingcited by 33
  7. 2018Reacting to Variations in Product Demand: An Application for Conversion Rate (CR) Prediction in Sponsored Searchcited by 18
  8. 2018Correlated Multi-armed Bandits with a Latent Random Sourcecited by 6
  9. 2021Multi-armed Bandit Requiring Monotone Arm Sequencescited by 5
  10. 2018A Unified Approach to Translate Classical Bandit Algorithms to the Structured Bandit Settingcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.