# Decision Forest: A Nonparametric Approach to Modeling Irrational Choice

@article{Chen2019DecisionFA, title={Decision Forest: A Nonparametric Approach to Modeling Irrational Choice}, author={Yi-Chun Chen and Velibor V. Mi{\vs}i{\'c}}, journal={ArXiv}, year={2019}, volume={abs/1904.11532} }

Customer behavior is often assumed to follow weak rationality, which implies that adding a product to an assortment will not increase the choice probability of another product in that assortment. However, an increasing amount of research has revealed that customers are not necessarily rational when making decisions. In this paper, we propose a new nonparametric choice model that relaxes this assumption and can model a wider range of customer behavior, such as decoy effects between products. In…

## Figures, Tables, and Topics from this paper

## 13 Citations

Assortment Optimization under the Decision Forest Model

- Computer Science, Mathematics
- 2021

This paper proposes a methodology for solving the problem of finding the assortment that maximizes expected revenue under the decision forest model, and shows that the Benders subproblem can be solved efficiently by primal-dual greedy algorithms.

On the estimation of discrete choice models to capture irrational customer behaviors

- Computer Science, EconomicsArXiv
- 2021

This work proposes an estimation method for the recently proposed Generalized Stochastic Preference choice model, which subsumes the family of Random Utility Maximization models and is capable of capturing halo effects, and shows how to use partially-ranked preferences to efficiently model rational and irrational customer types from transaction data.

The Use of Binary Choice Forests to Model and Estimate Discrete Choices

- Computer Science, EconomicsSSRN Electronic Journal
- 2019

We show the equivalence of discrete choice models and the class of binary choice forests, which are random forests based on binary choice trees. This suggests that standard machine learning…

When is Assortment Optimization Optimal?

- Computer ScienceArXiv
- 2021

This paper introduces a mechanism design problem where the items have fixed prices and the seller optimizes over (randomized) allocations, given a distribution for how a buyer ranks the items, and derives a sufficient condition, based purely on the buyer’s preference distribution, that guarantees assortments to be optimal within the larger class of randomized mechanisms.

The Value of Robust Assortment Optimization Under Ranking-based Choice Models

- Mathematics
- 2021

The ranking-based choice model is a popular model in revenue management for predicting demand for a firm’s products based on the assortment of products that the firm offers to their customers.…

Variety and Inventory Trade-off in Retailing: An Empirical Study

- 2021

We investigate the trade-off between variety and inventory in retailing using a proprietary data set from a bookstore chain. In general, more variety is expected to generate higher traffic to store…

Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items

- Mathematics
- 2021

Problem definition: Mining for heterogeneous responses to an intervention is a crucial step for data-driven operations, for instance to personalize treatment or pricing. We investigate how to…

Data-Driven Research in Retail Operations - A Review

- Computer Science
- 2020

This paper surveys state-of-the-art studies in three core aspects of retail operations -- assortment optimization, order fulfillment, and inventory management.

Applied Machine Learning in Operations Management

- Computer Science
- 2020

This work highlights how both supervised and unsupervised learning shape operations management research in both descriptive and prescriptive analyses, and identifies several exciting future directions at the intersection of machine learning and operations management.

Applied Machine Learning in Operations Management

- Innovative Technology at the Interface of Finance and Operations
- 2021

## References

SHOWING 1-10 OF 74 REFERENCES

A Market Discovery Algorithm to Estimate a General Class of Nonparametric Choice Models

- Economics, Computer ScienceManag. Sci.
- 2015

A market discovery algorithm that starts with a parsimonious set of types and enlarge it by automatically generating new types that increase the likelihood value is proposed, which improves the root mean square errors between predicted and observed purchases computed under independent demand model estimates.

A Nonparametric Joint Assortment and Price Choice Model

- Economics, Computer ScienceManag. Sci.
- 2017

A tractable nonparametric expectation maximization (EM) algorithm is developed to fit the model to the aggregate transaction data and an efficient algorithm is designed to determine the profit-maximizing combination of offer set and price.

The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization

- Economics, Computer ScienceOper. Res.
- 2016

This work investigates the use of a canonical version of a discrete choice model due to Daganzo (1979) in optimal pricing and assortment planning and demonstrates how the EC model can be easily estimated---by establishing that the loglikelihood function is concave in model parameters and detailing an estimation example using real data.

A Nonparametric Approach to Modeling Choice with Limited Data

- Computer Science, EconomicsManag. Sci.
- 2013

This paper investigates a nonparametric approach in which the data automatically select the right choice model for revenue predictions and demonstrates a 20% improvement in prediction accuracy over state-of-the-art benchmark models.

A Markov Chain Approximation to Choice Modeling

- Computer Science, MathematicsOper. Res.
- 2016

A Markov chain based choice model is considered and it is shown that it provides a simultaneous approximation for all random utility based discrete choice models including the multinomial logit (MNL), the probit, the nested logit and mixtures of multin coefficients logit models.

Technical Note - An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand

- Mathematics, Computer ScienceOper. Res.
- 2017

The EM method is applied to jointly estimate the arrival rate of customers and the pmf of the rank-based choice model, and it is shown that it leads to a simple and highly ecient estimation procedure.

Assortment Optimization Under Consider-Then-Choose Choice Models

- Computer ScienceManag. Sci.
- 2021

A dynamic programming framework to study the computational aspects of assortment optimization under consider-then-choose premises and is able to show that for many empirically vetted assumptions on how customers consider and choose, the resulting dynamic program is efficient.

Capacity Constrained Assortment Optimization Under the Markov Chain Based Choice Model

- Mathematics, Economics
- 2015

Assortment 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…

Assortment Optimization Under Consider-Then-Choose Choice Models

- Computer Science
- 2015

A dynamic programming framework to study the computational aspects of assortment optimization models posited on consider-then-choose premises is developed and it is able to show that for many practical and empirically vetted assumptions on how customers consider and choose, the resulting dynamic program is efficient.

The Generalized Stochastic Preference Choice Model

- Computer Science, MathematicsArXiv
- 2018

A new discrete choice model that generalizes the random utility model (RUM), called the Generalized Stochastic Preference (GSP) model, which can explain several choice phenomena that can't be represented by a RUM.