A necessary but insufficient condition for the stochastic binary choice problem

DOI10.1016/0022-2496(90)90019-6MaRDI QIDQ1813607zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A game-theoretic approach to the binary stochastic choice problem
• scientific article; zbMATH DE number 4164498
• Random utility representation of binary choice probabilities: A new class of necessary conditions
• Binary choice probabilities and rankings

Cites work

• scientific article; zbMATH DE number 3156726 (Why is no real title available?)
• scientific article; zbMATH DE number 3683298 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• 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
• 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
• Mixed models, random utilities, and the triangle inequality

Cited in

(25)

• 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
• Random utility representation of binary choice probabilities: A new class of necessary conditions
• Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
• Binary choice probabilities and rankings
• On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
• On the integral dicycle packings and covers and the linear ordering polytope
• The stochastic choice problem: A game-theoretic approach
• \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
• Analysis of multinomial models under inequality constraints: applications to measurement theory
• The strongest facets of the acyclic subgraph polytope are unknown
• scientific article; zbMATH DE number 4164498 (Why is no real title available?)
• The interval order polytope of a digraph
• Signed orders, choice probabilities, and linear polytopes
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• On the multiplicative inequality
• A short proof of a theorem of Falmagne.
• A conjecture on the construction of orderings by Borda's rule
• 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: A necessary but insufficient condition for the stochastic binary choice problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813607)