A necessary but insufficient condition for the stochastic binary choice problem

DOI10.1016/0022-2496(90)90019-6zbMath0761.92054OpenAlexW1982907920MaRDI QIDQ1813607

Itzhak Gilboa

Publication date: 25 June 1992

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

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/818.pdf

zbMATH Keywords

linear orderingsCohen-Falmagne conditionsdiagonal inequalityFishburn conditionsstochastic binary choice problem

Mathematics Subject Classification ID

Social and behavioral sciences: general topics (91C99) Individual preferences (91B08) Mathematical psychology (91E99)

Related Items

More facets from fences for linear ordering and acyclic subgraph polytopes, Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting, A conjecture on the construction of orderings by Borda's rule, On the integral dicycle packings and covers and the linear ordering polytope, On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope, The interval order polytope of a digraph, Binary single-crossing random utility models, Weak order polytopes., Induced binary probabilities and the linear ordering polytope: A status report, Geometric and combinatorial properties of the polytope of binary choice probabilities, The strongest facets of the acyclic subgraph polytope are unknown, The stochastic choice problem: A game-theoretic approach, A game-theoretic approach to the binary stochastic choice problem, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, Analysis of multinomial models under inequality constraints: applications to measurement theory, \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference, Signed orders, choice probabilities, and linear polytopes, Outranking Relations: Do They Have Special Properties?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Mixed models, random utilities, and the triangle inequality
• A representation theorem for finite random scale systems
• Binary choice probabilities and rankings
• Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings