Algorithmic Discrete Choice

Author(s)
Kumar, Ravi
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Series
Series
Collections
Supplementary to:
Abstract
In this talk we consider random utility models for discrete choice. In discrete choice, the task is to select exactly one element from a discrete set of alternatives. We focus on algorithmic questions in this and related models, ranging from reconstructing the model parameters to identifiability of mixtures of models.
Sponsor
Date
2019-11-04
Extent
49:05 minutes
Resource Type
Moving Image
Resource Subtype
Lecture
Rights Statement
Rights URI