Pricing Problems under the Markov Chain Choice Model

We consider pricing problems when customers choose under the Markov chain choice model. In this choice model, a customer arriving into the system is interested in a certain product with a certain probability. Depending on the price charged for this product, the customer decides whether to purchase the product. If the customer purchases the product, then she leaves the system. Otherwise, the customer transitions to another product or to the no purchase option with certain transition probabilities. In this way, the customer transitions between the products until she purchases a product or reaches the no purchase option. We study three fundamental pricing problems under this choice model. First, for the monopolistic pricing problem, we show how to compute the optimal prices efficiently. Second, for the competitive pricing problem, we show that a Nash equilibrium exists, prove that Nash equilibrium prices are no larger than the prices computed by a central planner controlling all prices and characterize a Nash equilibrium that Pareto dominates all other Nash equilibria. Third, for the dynamic pricing problem with a single resource, we show that the optimal prices decrease as we have more resource capacity or as we get closer to the end of the selling horizon. We also consider a deterministic approximation formulated under the assumption that the demand for each product takes on its expected value. Although the objective function and constraints in this approximation do not have explicit expressions, we develop an equivalent reformulation with explicit expressions for the objective function and constraints.

[1]  X. Vives Nash equilibrium with strategic complementarities , 1990 .

[2]  Georgia Perakis,et al.  Efficient formulations for pricing under attraction demand models , 2013, Math. Program..

[3]  Constantinos Maglaras,et al.  Dynamic Pricing Strategies for Multi-Product Revenue Management Problems , 2009, Manuf. Serv. Oper. Manag..

[4]  Guang Li,et al.  The d-Level Nested Logit Model: Assortment and Price Optimization Problems , 2015, Oper. Res..

[5]  Moshe Givon Variety Seeking Through Brand Switching , 1984 .

[6]  Danny Segev,et al.  Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice Model , 2015 .

[7]  Chao Liu,et al.  Efficient multiple-click models in web search , 2009, WSDM '09.

[8]  K. Bawa Modeling Inertia and Variety Seeking Tendencies in Brand Choice Behavior , 1990 .

[9]  Huseyin Topaloglu,et al.  Constrained Assortment Optimization for the Nested Logit Model , 2014, Manag. Sci..

[10]  Warren H. Hausman,et al.  Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis.: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis. , 2000 .

[11]  Jing-Sheng Song,et al.  Demand Management and Inventory Control for Substitutable Products , 2007 .

[12]  Garrett J. van Ryzin,et al.  A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management , 1997, Oper. Res..

[13]  Richard Ratliff,et al.  A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice , 2015, Oper. Res..

[14]  Abel P. Jeuland,et al.  Brand Choice Inertia as One Aspect of the Notion of Brand Loyalty , 1979 .

[15]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[16]  Danny Segev,et al.  Constrained Assortment Optimization Under the Markov Chain-based Choice Model , 2020, Manag. Sci..

[17]  Robert Phillips,et al.  Price Competition with the Attraction Demand Model: Existence of Unique Equilibrium and Its Stability , 2006, Manuf. Serv. Oper. Manag..

[18]  Ruxian Wang Capacitated Assortment and Price Optimization under the Multinomial Logit Model , 2012 .

[19]  D. M. Topkis Equilibrium Points in Nonzero-Sum n-Person Submodular Games , 1979 .

[20]  Costis Maglaras Dynamic Pricing Strategies for Multiproduct Revenue Management Problems , 2011 .

[21]  Garrett J. van Ryzin,et al.  On the Choice-Based Linear Programming Model for Network Revenue Management , 2008, Manuf. Serv. Oper. Manag..

[22]  J. Blanchet,et al.  A markov chain approximation to choice modeling , 2013, EC '13.

[23]  Ward Hanson,et al.  Optimizing Multinomial Logit Profit Functions , 1996 .

[24]  Aydin Alptekinoglu,et al.  The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization , 2015, Oper. Res..

[25]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[26]  Hongmin Li,et al.  Pricing Multiple Products with the Multinomial Logit and Nested Logit Models: Concavity and Implications , 2011, Manuf. Serv. Oper. Manag..

[27]  Nick Craswell,et al.  An experimental comparison of click position-bias models , 2008, WSDM '08.

[28]  Huseyin Topaloglu,et al.  Revenue Management Under the Markov Chain Choice Model , 2017, Oper. Res..

[29]  Dan Zhang,et al.  Reductions of Approximate Linear Programs for Network Revenue Management , 2015, Oper. Res..

[30]  Paul R. Milgrom,et al.  Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities , 1990 .

[31]  Huseyin Topaloglu,et al.  Technical Note - An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model , 2018, Oper. Res..

[32]  Itzhak Gilboa,et al.  History Dependent Brand Switching: Theory and Evidence , 1995 .

[33]  Guillermo Gallego,et al.  WORKING PAPER SERIES , 2011 .

[34]  Zhaosong Lu,et al.  Assessing the Value of Dynamic Pricing in Network Revenue Management , 2013, INFORMS J. Comput..

[35]  G. Iyengar,et al.  Managing Flexible Products on a Network , 2004 .

[36]  K. Talluri,et al.  An Analysis of Bid-Price Controls for Network Revenue Management , 1998 .