Discrete Choice

Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models

A common theory of choice posits that individuals make choices in a two-step process, first selecting some subset of the alternatives …

Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng

Graph-based Methods for Discrete Choice

We adapt graph learning methods to incorporate network structure into discrete choice models.

Kiran Tomlinson, Austin R. Benson

Graph-based Methods for Discrete Choice

Learning Interpretable Feature Context Effects in Discrete Choice

We introduce a broad class of context effects in discrete choice and show that these effects are common in choice data, including choices coming from social networks.

Kiran Tomlinson, Austin R. Benson

Choice Set Confounding in Discrete Choice

We show how confounding can mislead choice models and adapt several causal inference methods to train unbiased models from observational data.

Kiran Tomlinson, Johan Ugander, Austin R. Benson

Choice Set Confounding in Discrete Choice

Choice Set Optimization Under Discrete Choice Models of Group Decisions

We study the problem of finding the optimal set of alternatives to introduce to a group to minimize their disagreement and other related problems.

Kiran Tomlinson, Austin R. Benson

Discrete Choice Models

Choosing is one of the most common and important actions people take: we choose where to work, how to get there, who to vote for, and what to have for lunch.

Mar 6, 2020 8 min read Discrete Choice