Regular choice systems: a general technique to represent them by random variables

DOI10.1016/j.jmp.2016.04.003zbMath1396.91181OpenAlexW2412581338MaRDI QIDQ730163

Reinhard Suck

Publication date: 23 December 2016

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

Full work available at URL: https://doi.org/10.1016/j.jmp.2016.04.003

zbMATH Keywords

Möbius functionBlock-Marschak conditionsincomplete regular choice systemsordering polytopesrandom utility representations

Mathematics Subject Classification ID

Partial orders, general (06A06) Decision theory (91B06) Utility theory (91B16)

Related Items (2)

Adjacencies on random ordering polytopes and flow polytopes ⋮ Regular random choice and the triangle inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random utility representation of binary choice probabilities: A new class of necessary conditions
• 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
• Induced binary probabilities and the linear ordering polytope: A status report
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• An approval-voting polytope for linear orders
• A short proof of a theorem of Falmagne.
• Random relations, random utilities, and random functions
• Independent random utility representations
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Some probabilistic models of best, worst, and best --- worst choices
• An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis
• Lectures on Polytopes

This page was built for publication: Regular choice systems: a general technique to represent them by random variables