Decision Forest: A Nonparametric Approach to Modeling Irrational Choice

References

• Aouad A, Farias VF, Levi R (2021) Assortment optimization under consider-then-choose choice models. Management Sci. 67(6):3368–3386.Link, Google Scholar
• Aouad A, Farias V, Levi R, Segev D (2018) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
• Ariely D (2008) Predictably Irrational (HarperCollins, New York).Google Scholar
• Ben-Akiva ME, Lerman SR (1985) Discrete Choice Analysis: Theory and Application to Travel Demand (MIT Press, Cambridge, MA).Google Scholar
• Berbeglia G (2018) The generalized stochastic preference choice model. Preprint, submitted March 13, https://arxiv.org/abs/1803.04244.Google Scholar
• Bertsimas D, Mišić VV (2019) Exact first-choice product line optimization. Oper. Res. 67(3):651–670.Link, Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Block HD, Marschak J (1959) Random orderings and stochastic theories of response. Technical report, Cowles Foundation for Research in Economics, Yale University, New Haven, CT.Google Scholar
• Breiman L (2001) Random forests. Machine Learning 45(1):5–32.Crossref, Google Scholar
• Breiman L, Friedman J, Stone CJ, Olshen RA (1984) Classification and Regression Trees (CRC Press, Boca Raton, FL).Google Scholar
• Bronnenberg BJ, Mela CF (2004) Market roll-out and retailer adoption for new brands. Marketing Sci. 23(4):500–518.Link, Google Scholar
• Bronnenberg BJ, Kruger MW, Mela CF (2008) Database paper—The IRI marketing data set. Marketing Sci. 27(4):745–748.Link, Google Scholar
• Calafiore G, Campi M (2005) Uncertain convex programs: Randomized solutions and confidence levels. Math. Programming 102(1):25–46.Crossref, Google Scholar
• Chen T, Guestrin C (2016) Xgboost: A scalable tree boosting system. Krishnapuram B, Shah M, eds. Proc. 22nd ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York, NY, USA), 785–794.Google Scholar
• Désir A, Goyal V, Segev D, Ye C (2020) Constrained assortment optimization under the Markov chain-based choice model. Oper. Res. 66(2):698–721. Google Scholar
• Désir A, Goyal V, Jiang B, Xie T, Zhang J (2021) Robust assortment optimization under the Markov chain model. Working paper, INSEAD, Fontainebleau, France.Google Scholar
• Dogan S, Yildiz K (2018) Every choice function is pro-con ratioanlizable. Preprint, submitted November 25, https://dx.doi.org/10.2139/ssrn.3085542.Google Scholar
• Echenique F, Saito K (2019) General Luce model. Econom. Theory 68(2019):811–826.Crossref, Google Scholar
• Echenique F, Saito K, Tserenjigmid G (2018) The perception-adjusted Luce model. Math. Social Sci. 93:67–76.Crossref, Google Scholar
• Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322. Link, Google Scholar
• Feldman JB, Topaloglu H (2017) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Feldman J, Paul A, Topaloglu H (2019) Technical note—Assortment optimization with small consideration sets. Oper. Res. 67(5):1283–1299.Link, Google Scholar
• Ferreira KJ, Lee BHA, Simchi-Levi D (2015) Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing Service Oper. Management 18(1):69–88.Link, Google Scholar
• Freund Y, Schapire R (1996) Experiments with a new boosting algorithm. Saitta L, ed. Machine Learn. Proc. Thirteenth Internat. Conf. (Morgan Kauffman, San Francisco), 148–156.Google Scholar
• Friedman JH (2001) Greedy function approximation: A gradient boosting machine. Ann. Statist. 29(5):1189–1232. Crossref, Google Scholar
• Gallego G, Ratliff R, Shebalov S (2014) A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Hauser JR (2014) Consideration-set heuristics. J. Bus. Res. 67(8):1688–1699.Crossref, Google Scholar
• Horan S (2011) Choice by tournament. Working paper, Boston University, Boston, http://www.cirpee.uqam.ca/JOURNEES_CIRPEE_2011/S_HORAN_tree_choice(5-2).pdf.Google Scholar
• Huber J, Payne JW, Puto C (1982) Adding asymmetrically dominated alternatives: Violations of regularity and the similarity hypothesis. J. Consumer Res. 9(1):90–98.Crossref, Google Scholar
• Jagabathula S, Rusmevichientong P (2016) A nonparametric joint assortment and price choice model. Management Sci. 63(9):3128–3145.Link, Google Scholar
• Jagabathula S, Rusmevichientong P (2019) The limit of rationality in choice modeling: Formulation, computation, and implications. Management Sci. 65(5):2196–2215.Abstract, Google Scholar
• Kahneman D, Tversky A (1979) Prospect theory: An analysis of decision under risk. Econometrica 47(2):263–292.Crossref, Google Scholar
• Li J, Tang R (2017) Every random choice rule is backward-induction rationalizable. Games Econom. Behav. 104:563–567.Crossref, Google Scholar
• Maragheh RY, Chronopoulou A, Davis JM (2018) A customer choice model with HALO effect. Preprint, submitted May 4, https://arxiv.org/abs/1805.01603.Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.Crossref, Google Scholar
• Mishra VK, Natarajan K, Padmanabhan D, Teo C-P, Li X (2014) On theoretical and empirical aspects of marginal distribution choice models. Management Sci. 60(6):1511–1531.Link, Google Scholar
• Mišić VV (2016) Data, models and decisions for large-scale stochastic optimization problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Mišić VV (2020) Optimization of tree ensembles. Oper. Res. 68(5):1605–1624.Link, Google Scholar
• Moosmann F, Triggs B, Jurie F (2007) Fast discriminative visual codebooks using randomized clustering forests. Platt J, Koller D, Singer Y, Roweis S, eds. Adv. Neural Inform. Processing Systems (MIT Press, Cambridge, MA), 985–992.Google Scholar
• Natarajan K, Song M, Teo C-P (2009) Persistency model and its applications in choice modeling. Management Sci. 55(3):453–469. Link, Google Scholar
• Nijs VR, Srinivasan S, Pauwels K (2007) Retail-price drivers and retailer profits. Marketing Sci. 26(4):473–487.Link, Google Scholar
• Poundstone W (2010) Priceless: The Myth of Fair Value (and How to Take Advantage of It) (Hill and Wang, New York).Google Scholar
• Quinlan JR (1986) Induction of decision trees. Machine Learn. 1(1):81–106.Crossref, Google Scholar
• Quinlan JR (1993) C4.5: Programs for Machine Learning (Morgan Kaufmann, San Francisco).Google Scholar
• Rahimi A, Recht B (2008) Random features for large-scale kernel machines. Koller D, Schuurmans D, Bengio Y, Bottou L, eds. Adv. Neural Inform. Processing Systems (MIT Press, Cambridge, MA, USA), 1177–1184.Google Scholar
• Rahimi A, Recht B (2009) Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning. Bengio Y, Schuurmans D, Lafferty J, Williams C, Culotta A, eds. Adv. Neural Inform. Processing Systems (MIT Press, Cambridge, MA, USA), 1313–1320.Google Scholar
• Rieskamp J, Busemeyer JR, Mellers BA (2006) Extending the bounds of rationality: Evidence and theories of preferential choice. J. Econom. Literature 44(3):631–661.Crossref, Google Scholar
• Simonson I (1989) Choice based on reasons: The case of attraction and compromise effects. J. Consumer Res. 16(2):158–174.Crossref, Google Scholar
• Şimşek AS, Topaloglu H (2018) An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model. Oper. Res. 66(3):748–760.Link, Google Scholar
• Train KE (2009) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Tversky A (1969) Intransitivity of preferences. Psych. Rev. 76(1):31–48.Crossref, Google Scholar
• Tversky A (1972) Elimination by aspects: A theory of choice. Psych. Rev. 79(4):281–299.Crossref, Google Scholar
• Tversky A, Simonson I (1993) Context-dependent preferences. Management Sci. 39(10):1179–1189.Link, Google Scholar
• van Ryzin G, Vulcano G (2014) A market discovery algorithm to estimate a general class of nonparametric choice models. Management Sci. 61(2):281–300.Link, Google Scholar
• van Ryzin G, Vulcano G (2017) An expectation-maximization method to estimate a rank-based choice model of demand. Oper. Res. 65(2):396–407.Link, Google Scholar
• Xu Y, Zhou L (2007) Rationalizability of choice functions by game trees. J. Econom. Theory 134(1):548–556.Crossref, Google Scholar