SSRN Author: Chun YeChun Ye SSRN Content
http://www.ssrn.com/author=2419448
http://www.ssrn.com/rss/en-usFri, 23 Oct 2015 02:05:20 GMTeditor@ssrn.com (Editor)Fri, 23 Oct 2015 02:05:20 GMTwebmaster@ssrn.com (WebMaster)SSRN RSS Generator 1.0REVISION: Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice ModelAssortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In such settings, the goal is to select a subset of items to offer from a universe of substitutable items in order to maximize expected revenue when consumers exhibit a random substitution behavior. We consider a capacity constrained assortment optimization problem under the Markov Chain based choice model, recently considered by Blanchet et al. (2013). In this model, the substitution behavior of customers is modeled through transitions in a Markov chain. Capacity constraints arise naturally in many applications to model real-life constraints such as shelf space or budget limitations. We show that the capacity constrained problem is APX-hard even for the special case when all items have unit weights and uniform prices, i.e., it is NP-hard to obtain an approximation ratio better than some given constant. We present constant factor approximations for both ...
http://www.ssrn.com/abstract=2626484
http://www.ssrn.com/1438618.htmlThu, 22 Oct 2015 19:56:02 GMTREVISION: Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice ModelAssortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In such settings, the goal is to select a subset of items to offer from a universe of substitutable items in order to maximize expected revenue when consumers exhibit a random substitution behavior. We consider a capacity constrained assortment optimization problem under the Markov Chain based choice model, recently considered by Blanchet et al. (2013). In this model, the substitution behavior of customers is modeled through transitions in a Markov chain. Capacity constraints arise naturally in many applications to model real-life constraints such as shelf space or budget limitations. We show that the capacity constrained problem is APX-hard even for the special case when all items have unit weights and uniform prices, i.e., it is NP-hard to obtain an approximation ratio better than some given constant. We present constant factor approximations for both ...
http://www.ssrn.com/abstract=2626484
http://www.ssrn.com/1433194.htmlFri, 02 Oct 2015 13:50:47 GMTREVISION: Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice ModelAssortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In such settings, the goal is to select a subset of items to offer from a universe of substitutable items in order to maximize expected revenue when consumers exhibit a random substitution behavior. We consider a capacity constrained assortment optimization problem under the Markov Chain based choice model, recently considered by Blanchet et al. (2013). In this model, the substitution behavior of customers is modeled through transitions in a Markov chain. Capacity constraints arise naturally in many applications to model real-life constraints such as shelf space or budget limitations. We show that the capacity constrained problem is APX-hard even for the special case when all items have unit weights and uniform prices, i.e., it is NP-hard to obtain an approximation ratio better than some given constant. We present constant factor approximations for both ...
http://www.ssrn.com/abstract=2626484
http://www.ssrn.com/1409519.htmlSat, 04 Jul 2015 09:34:26 GMT