Random utility models with binary tree decomposable rank orders satisfy Tversky's elimination-by-aspects model
From MaRDI portal
Publication:1111491
Recommendations
- 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
- Publication:4890894
- Two-moment decision models and rank-dependent utility
Cites work
- 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?)
- Choice by elimination
- 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
Cited in
(3)- 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
- Relation between EBA and nested logit models
- 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)
