We study a multi-period, multi-product, dynamic pricing problem with price adjustment costs known as menu costs. In this setting, we assume that decision makers (e.g., retailers, online platforms) incur a fixed menu cost whenever prices are updated between periods, as well as a variable menu...

The main contribution of this paper is to develop new techniques in approximate dynamic programming, along with the notions of rounded distributions and inventory filtering, to devise a quasi-PTAS for the capacitated assortment planning problem, originally studied by Goyal, Levi, and Segev...