Random utility representation of binary choice probabilities: A new class of necessary conditions
From MaRDI portal
Recommendations
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Random utility representations of finite \(m\)-ary relations
- Random binary choices that satisfy stochastic betweenness
- A necessary but insufficient condition for the stochastic binary choice problem
- 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
Cited in
(31)- Stochastic revealed preference and rationalizability
- Outranking Relations: Do They Have Special Properties?
- A game-theoretic approach to the binary stochastic choice problem
- 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
- Bi-scalable and difference representations for triadic judgments
- On the integral dicycle packings and covers and the linear ordering polytope
- Regular random choice and the triangle inequalities
- The stochastic choice problem: A game-theoretic approach
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- A representation theorem for finite best-worst random utility models
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
- Decomposition of recurrent choices into stochastically independent counts
- Stochastic expected utility for binary choice: a `modular' axiomatic foundation
- How to recycle your facets
- Analysis of multinomial models under inequality constraints: applications to measurement theory
- Ternary paired comparisons induced by semi- or interval order preferences
- Fence facets from non-regular graphs for the linear ordering polytope
- Signed orders, choice probabilities, and linear polytopes
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures
- Random utility representations of finite \(m\)-ary relations
- Primary facets of order polytopes
- Regular choice systems: a general technique to represent them by random variables
- Ordinal distributions associated to 3-monotone matrices
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- On the multiplicative inequality
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
- Weak order polytopes.
- Binary single-crossing random utility models
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Induced binary probabilities and the linear ordering polytope: A status report
This page was built for publication: Random utility representation of binary choice probabilities: A new class of necessary conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582231)
