Random utility models with binary tree decomposable rank orders satisfy Tversky's elimination-by-aspects model
\textit{A. Tversky} [ibid. 9, 341-367 (1972; Zbl 0249.92010)] showed that his elimination-by-aspects model is a random utility model. He constructed the random utility representation by recursively defining a set of ranking probabilities on various sets. In this paper, we demonstrate the converse of this result, namely, that if a random utility model has ranking probabilities that satisfy Tversky's recursive formula, then the associated choice probabilities satisfy Tversky's elimination- by-aspects model. We also illustrate structures of preference and aversion probabilities, each of which satisfy the elimination-by-aspects model and which are compatible with a common random utility model.
- On rankings and top choices in random utility models with dependent utilities
- Random utility models with ordered types and domains
- Inequalities for random utility models, with applications to ranking and subset choice data
- scientific article; zbMATH DE number 3952488
- Two-parameter decision models and rank-dependent expected utility
- Rank- and sign-dependent linear utility models for binary gambles
- Binary single-crossing random utility models
- scientific article; zbMATH DE number 920136
- Two-moment decision models and rank-dependent utility
- Choice by elimination
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3156726 (Why is no real title available?)
- scientific article; zbMATH DE number 3241238 (Why is no real title available?)
- Joint independent random utility models where one of the choice structures satisfies the strict utility model
- Random utility models with equality: An apparent, but not actual, generalization of random utility models
- Relation between EBA and nested logit models
- A historical and contemporary perspective on random scale representations of choice probabilities and reaction times in the context of Cohen and Falmagne's (1990, Journal of Mathematical Psychology, 34) results
- On the equivalence between elimination-by-aspects and generalised extreme value models of choice behaviour
This page was built for publication: Random utility models with binary tree decomposable rank orders satisfy Tversky's elimination-by-aspects model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111491)
