# Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments

- 17 Downloads

## Abstract

The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are constructed by fixing a threshold revenue \(\pi \) and then choosing all products with revenue at least \(\pi \). This is known as the *revenue-ordered assortments* strategy. In this paper we study the approximation guarantees provided by revenue-ordered assortments when customers are rational in the following sense: the probability of selecting a specific product from the set being offered cannot increase if the set is enlarged. This rationality assumption, known as *regularity*, is satisfied by almost all discrete choice models considered in the revenue management and choice theory literature, and in particular by random utility models. The bounds we obtain are tight and improve on recent results in that direction, such as for the Mixed Multinomial Logit model by Rusmevichientong et al. (Prod Oper Manag 23(11):2023–2039, 2014). An appealing feature of our analysis is its simplicity, as it relies only on the regularity condition. We also draw a connection between assortment optimisation and two pricing problems called *unit demand envy-free pricing* and *Stackelberg minimum spanning tree*: these problems can be restated as assortment problems under discrete choice models satisfying the regularity condition, and moreover revenue-ordered assortments correspond then to the well-studied *uniform pricing* heuristic. When specialised to that setting, the general bounds we establish for revenue-ordered assortments match and unify the best known results on uniform pricing.

## Keywords

Assortment problem Envy-free pricing Stackelberg games## Notes

### Acknowledgements

We thank Victor Aguiar, Adrian Vetta, and Gustavo Vulcano for their insightful comments that greatly improved the paper. We are also grateful to the anonymous referees for their careful reading of the paper and helpful remarks.

## References

- 1.Abeliuk, A., Berbeglia, G., Cebrian, M., Van Hentenryck, P.: Assortment optimization under a multinomial logit model with position bias and social influence. 4OR
**14**(1), 57–75 (2016)MathSciNetzbMATHGoogle Scholar - 2.Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) Automata, Languages and Programming, pp. 72–83. Springer, Berlin (2004)Google Scholar
- 3.Aguiar, V.: Stochastic choice and attention capacities: inferring preferences from psychological biases. Available at SSRN 2607602 (2015)Google Scholar
- 4.Anderson, S.P., De Palma, A., Thisse, J.F.: Discrete Choice Theory of Product Differentiation. MIT press, Cambridge (1992)zbMATHGoogle Scholar
- 5.Aouad, A., Segev, D.: Display optimization for vertically differentiated locations under multinomial logit choice preferences. Available at SSRN 2709652 (2015)Google Scholar
- 6.Aouad, A., Farias, V.F., Levi, R.: Assortment optimization under consider-then-rank choice models. Available at SSRN 2618823 (2015)Google Scholar
- 7.Aouad, A., Farias, V., Levi, R., Segev, D.: The approximability of assortment optimization under ranking preferences. Oper. Res.
**66**(6), 1661–1669 (2018)MathSciNetGoogle Scholar - 8.Awasthi, P., Blum, A., Sheffet, O., Vijayaraghavan, A.: Learning mixtures of ranking models. In: Advances in Neural Information Processing Systems, pp. 2609–2617 (2014)Google Scholar
- 9.Berbeglia, G.: Discrete choice models based on random walks. Oper. Res. Lett.
**44**(2), 234–237 (2016)MathSciNetzbMATHGoogle Scholar - 10.Blanchet, J., Gallego, G., Goyal, V.: A markov chain approximation to choice modeling. In: 14th ACM Conference on Electronic Commerce, pp. 103–104 (2013)Google Scholar
- 11.Block, H.D., Marschak, J.: Random orderings and stochastic theories of responses. In: Olkin, I., Ghurye, S., Hoeffding, W., Madow, W., Mann, H. (eds.) Contributions to Probability and Statistics, vol. 2, pp. 97–132. Stanford University Press, Stanford (1960) Google Scholar
- 12.Briest, P., Krysta, P.: Buying cheap is expensive: approximability of combinatorial pricing problems. SIAM J. Comput.
**40**(6), 1554–1586 (2011)MathSciNetzbMATHGoogle Scholar - 13.Bront, J.J.M., Méndez-Díaz, I., Vulcano, G.: A column generation algorithm for choice-based network revenue management. Oper. Res.
**57**(3), 769–784 (2009)zbMATHGoogle Scholar - 14.Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The stackelberg minimum spanning tree game. Algorithmica
**59**(2), 129–144 (2011)MathSciNetzbMATHGoogle Scholar - 15.Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 73–84. Springer, Berlin (2012)Google Scholar
- 16.Davis, J., Gallego, G., Topaloglu, H.: Assortment planning under the multinomial logit model with totally unimodular constraint structures. Department of IEOR, Columbia University (2013). http://www.columbia.edu/~gmg2/logit_const.pdf. Accessed 31 Jan 2017
- 17.Désir, A., Goyal, V., Segev, D., Ye, C.: Capacity constrained assortment optimization under the markov chain based choice model. Available at SSRN 2626484 (2015)Google Scholar
- 18.Diaconis, P.: Group representations in probability and statistics. Lecture Notes-Monograph Series, pp i–192 (1988)Google Scholar
- 19.Echenique, F., Saito, K., Tserenjigmid, G.: The perception-adjusted Luce model. Math. Soc. Sci.
**93**, 67–76 (2018)MathSciNetzbMATHGoogle Scholar - 20.Feldman, J., Topaloglu, H.: Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Prod. Oper. Manag.
**24**(10), 1598–1620 (2015)Google Scholar - 21.Feldman, J., Zhang, D., Liu, X., Zhang, N.: Taking assortment optimization from theory to practice: evidence from large field experiments on Alibaba. Available at SSRN 3232059 (2018)Google Scholar
- 22.Feldman, J.B., Topaloglu, H.: Revenue management under the Markov chain choice model. Oper. Res.
**65**(5), 1322–1342 (2017)MathSciNetzbMATHGoogle Scholar - 23.Fudenberg, D., Iijima, R., Strzalecki, T.: Stochastic choice and revealed perturbed utility. Econometrica
**83**(6), 2371–2409 (2015)MathSciNetzbMATHGoogle Scholar - 24.Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 1164–1173 (2005)Google Scholar
- 25.Jagabathula, S.: Assortment optimization under general choice. Available at SSRN 2512831 (2014)Google Scholar
- 26.Jagabathula, S., Vulcano, G.: A partial-order-based model to estimate individual preferences using panel data. Manag. Sci.
**64**(4), 1609–1628 (2018)Google Scholar - 27.Kendall, M.G.: A new measure of rank correlation. Biometrika
**30**, 81–93 (1938)zbMATHGoogle Scholar - 28.Koning, R.H., Ridder, G.: Discrete choice and stochastic utility maximization. Econ. J.
**6**(1), 1–27 (2003)MathSciNetzbMATHGoogle Scholar - 29.Luce, D.: Individual Choice Behavior. Wiley, New York (1965)Google Scholar
- 30.Luce, R.D., Suppes, P.: Preference, utility, and subjective probability (chapter 19). In: Bush, R.R., Luce, R.D., Galanter, E. (eds.) Handbook of Mathematical Psychology, vol. 3, pp. 249–410. Wiley, New York (1965)Google Scholar
- 31.Mallows, C.L.: Non-null ranking models. I. Biometrika
**44**, 114–130 (1957)MathSciNetzbMATHGoogle Scholar - 32.Manzini, P., Mariotti, M.: Stochastic choice and consideration sets. Econometrica
**82**(3), 1153–1176 (2014)MathSciNetzbMATHGoogle Scholar - 33.McClellon, M., et al.: Non-additive random utility functions. Technical report (2015). https://scholar.harvard.edu/mcclellon/publications/non-additive-random-utility-functions. Accessed 31 Jan 2017
- 34.McFadden, D., Richter, M.K.: Stochastic rationality and revealed stochastic preference. In: Chipman, J.S., McFadden, D., Richter, M.K. (eds.) Preferences, Uncertainty, and Optimality, Essays in Honor of Leo Hurwicz, pp. 161–186. Westview Press, Boulder (1990)Google Scholar
- 35.Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P.: A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math.
**164**, 246–263 (2014)MathSciNetzbMATHGoogle Scholar - 36.Murphy, T.B., Martin, D.: Mixtures of distance-based models for ranking data. Comput. Stat. Data Anal.
**41**(3), 645–655 (2003)MathSciNetzbMATHGoogle Scholar - 37.Ragain, S., Ugander, J.: Pairwise choice markov chains. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS’16. Curran Associates Inc., pp. 3206–3214 (2016). arXiv:1603.02740
- 38.Rusmevichientong, P.: A Non-parametric approach to multi-product pricing theory and application. PhD thesis, Stanford University (2003)Google Scholar
- 39.Rusmevichientong, P., Topaloglu, H.: Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res.
**60**(4), 865–882 (2012)MathSciNetzbMATHGoogle Scholar - 40.Rusmevichientong, P., Van Roy, B., Glynn, P.W.: A nonparametric approach to multiproduct pricing. Oper. Res.
**54**(1), 82–98 (2006)MathSciNetzbMATHGoogle Scholar - 41.Rusmevichientong, P., Shen, Z.-J.M., Shmoys, D.B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res.
**58**(6), 1666–1680 (2010)MathSciNetzbMATHGoogle Scholar - 42.Rusmevichientong, P., Shmoys, D., Tong, C., Topaloglu, H.: Assortment optimization under the multinomial logit model with random choice parameters. Prod. Oper. Manag.
**23**(11), 2023–2039 (2014)Google Scholar - 43.Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Vol. B. Volume 24 of Algorithms and Combinatorics. Springer, Berlin (2003).
**(Matroids, trees, stable sets, chapters 39–69)**zbMATHGoogle Scholar - 44.Talluri, K., Van Ryzin, G.: Revenue management under a general discrete choice model of consumer behavior. Manag. Sci.
**50**(1), 15–33 (2004)zbMATHGoogle Scholar - 45.Talluri, K.T., Van Ryzin, G.J.: The Theory and Practice of Revenue Management, vol. 68. Springer, Berlin (2006)zbMATHGoogle Scholar
- 46.Thurstone, L.L.: A law of comparative judgment. Psychol. Rev.
**34**(4), 273 (1927)Google Scholar - 47.Webb, R.: The (neural) dynamics of stochastic choice. Manag. Sci.
**65**(1), 230–255 (2019)MathSciNetGoogle Scholar - 48.Webb, R., Glimcher, P.W., Levy, I., Lazzaro, S.C., Rutledge, R.B.: Neural random utility: relating cardinal neural observables to stochastic choice behaviour. Available at SSRN 2143215 (2016)Google Scholar
- 49.Young, H.P.: Condorcet’s theory of voting. Am. Polit. Sci. Rev.
**82**(04), 1231–1244 (1988)Google Scholar