Product sequencing and pricing under cascade browse model

We study the assortment optimization problem under the newly proposed cascade browse model. We propose a constant approximate solution to this problem. As a byproduct, we propose the first fully polynomial-time approximation scheme (FPTAS) for the classic assortment optimization problem subject to one capacity constraint and one cardinality constraint. We also studied a joint pricing and sequencing problem under the above model and develop a constant approximate solution to this problem.