A central question in probabilistic preference theory is to find testable necessary and sufficient conditions on experimental choice data, i.e. the complete system of choice probabilities, such that these data satisfy the random utility model. Under the non-coincidence assumption, a complete system of choice probabilities arises from the random utility model if and only if it is induced by rankings. This fundamental result was proved by \textit{J. C. Falmagne} [J. Math. Psychol. 18, 52--72 (1978; Zbl 0408.62093)], involving Block-Marschak inequalities and the normalization equalities for a complete system of choice probabilities. The purpose of the present note is to provide a short proof for the Falmagne basin result using an approach that combines Möbius inversion and network flows. Interesting remarks on the proof evolution of the Falmagne's theorem are also given.
- Publication:4938544
- Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
- On ``choice probabilities derived from ranking distributions
- A necessary but insufficient condition for the stochastic binary choice problem
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- A course in combinatorics.
- A representation theorem for finite random scale systems
- Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
- scientific article; zbMATH DE number 3156726 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 863499 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- The stochastic choice problem: A game-theoretic approach
- Analysis of multinomial models under inequality constraints: applications to measurement theory
- Dual random utility maximisation
- Extended formulations for order polytopes through network flows
- Disentangling preferences and limited attention: random-utility models with consideration sets
- Regular random choice and the triangle inequalities
- Identification in the random utility model
- A correct response model in knowledge structure theory
- Bayesian inference and model comparison for random choice structures
- Prior distributions for random choice structures
- 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
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- What independent random utility representations are equivalent to the IIA assumption?
- Confidence models of incomplete preferences
- A lexicographic semiorder polytope and probabilistic representations of choice
- scientific article; zbMATH DE number 1405565 (Why is no real title available?)
- Relations between best, worst, and best-worst choices for random utility models
- Adjacencies on random ordering polytopes and flow polytopes
- Branching-independent random utility model
- Methods for testing the random utility model
- Correlated choice
- Revealed preference domains from random choice
- Random utility without regularity
- Resolutions of probabilistic choice spaces
- An alternative approach for nonparametric analysis of random utility models
- Cycle conditions for ``Luce rationality
- The limits of identification in discrete choice
- Matrix rationalization via partial orders
- Representing choice probabilities by ranking probabilities via entropy maximization
- Regular choice systems: a general technique to represent them by random variables
- A representation theorem for finite best-worst random utility models
This page was built for publication: A short proof of a theorem of Falmagne.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431817)
