Discrete Choice Models
16 papers with code • 0 benchmarks • 0 datasets
Benchmarks
These leaderboards are used to track progress in Discrete Choice Models
Libraries
Use these libraries to find Discrete Choice Models models and implementationsMost implemented papers
Enhancing Discrete Choice Models with Representation Learning
In discrete choice modeling (DCM), model misspecifications may lead to limited predictability and biased parameter estimates.
A Neural-embedded Choice Model: TasteNet-MNL Modeling Taste Heterogeneity with Flexibility and Interpretability
Our formulation consists of two modules: a neural network (TasteNet) that learns taste parameters (e. g., time coefficient) as flexible functions of individual characteristics; and a multinomial logit (MNL) model with utility functions defined with expert knowledge.
Representing Random Utility Choice Models with Neural Networks
Motivated by the successes of deep learning, we propose a class of neural network-based discrete choice models, called RUMnets, inspired by the random utility maximization (RUM) framework.
A branch-and-cut algorithm for the latent-class logit assortment problem
artefactory/choice-learn
•
•
Discrete Applied Mathematics 2014
We study the product assortment problem of a retail operation that faces a stream of customers who are heterogeneous with respect to preferences.
Choice Set Optimization Under Discrete Choice Models of Group Decisions
tomlinsonk/choice-set-opt
•
•
ICML 2020
The way that people make choices or exhibit preferences can be strongly affected by the set of available alternatives, often called the choice set.
Robust discrete choice models with t-distributed kernel errors
In a case study on transport mode choice behaviour, MNR and Gen-MNR outperform MNP by substantial margins in terms of in-sample fit and out-of-sample predictive accuracy.
Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution
Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard.
Choice Set Confounding in Discrete Choice
tomlinsonk/choice-set-confounding
•
•
Standard methods in preference learning involve estimating the parameters of discrete choice models from data of selections (choices) made by individuals from a discrete set of alternatives (the choice set).
Identification of Incomplete Preferences
We provide a sharp identification region for discrete choice models where consumers' preferences are not necessarily complete even if only aggregate choice data is available.
Combining Discrete Choice Models and Neural Networks through Embeddings: Formulation, Interpretability and Performance
ioaar/interpretable-embeddings-mnl
•
•
The novelty of our work lies in enforcing interpretability to the embedding vectors by formally associating each of their dimensions to a choice alternative.
