mlsanityData to 7 Oct 2026

A Nonparametric Approach with Marginals for Modeling Consumer Choice

arXiv 2208.06115 ↗First posted 12 Aug 2022stat.ML econ.EM math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

Given data on the choices made by consumers for different offer sets, a key challenge is to develop parsimonious models that describe and predict consumer choice behavior while being amenable to prescriptive tasks such as pricing and assortment optimization. The marginal distribution model (MDM) is one such model, which requires only the specification of marginal distributions of the random utilities. This paper aims to establish necessary and sufficient conditions for given choice data to be consistent with the MDM hypothesis, inspired by the usefulness of similar characterizations for the random utility model (RUM). This endeavor leads to an exact characterization of the set of choice probabilities that the MDM can represent. Verifying the consistency of choice data with this characterization is equivalent to solving a polynomial-sized linear program. Since the analogous verification task for RUM is computationally intractable and neither of these models subsumes the other, MDM is helpful in striking a balance between tractability and representational power. The characterization is then used with robust optimization for making data-driven sales and revenue predictions for new unseen assortments. When the choice data lacks consistency with the MDM hypothesis, finding the best-fitting MDM choice probabilities reduces to solving a mixed integer convex program. Numerical results using real world data and synthetic data demonstrate that MDM exhibits competitive representational power and prediction performance compared to RUM and parametric models while being significantly faster in computation than RUM.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 63 references that are in the map. First posted on arXiv 12 Aug 2022.

Builds on

9 of 63 references.

References · 9

  1. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  2. 2017A Rewriting System for Convex Optimization Problemscited by 178
  3. 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
  4. 2019Decision Forest: A Nonparametric Approach to Modeling Irrational Choicecited by 10
  5. 2022Representing Random Utility Choice Models with Neural Networkscited by 10
  6. 2016Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortmentscited by 5
  7. 2021The Value of Robust Assortment Optimization Under Ranking-based Choice Modelscited by 4
  8. 2022On the Global Convergence of Stochastic Fictitious Play in Stochastic Games with Turn-based Controllerscited by 3
  9. 2019The Use of Binary Choice Forests to Model and Estimate Discrete Choicescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.