Random utility models with binary tree decomposable rank orders satisfy Tversky's elimination-by-aspects model

DOI10.1016/0022-2496(88)90022-3zbMath0657.92022OpenAlexW2038135015WikidataQ57086501 ScholiaQ57086501MaRDI QIDQ1111491

Anthony A. J. Marley

Publication date: 1988

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(88)90022-3

zbMATH Keywords

choice probabilitiesrandom utility modelranking probabilitieselimination-by-aspects modelpreference and aversion probabilitiesTversky's recursive formula

Mathematics Subject Classification ID

Mathematical psychology (91E99)

Related Items

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

Cites Work

• 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
• Choice by elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item