A short proof of a theorem of Falmagne.
DOI10.1016/J.JMP.2003.11.003zbMATH Open1053.60009OpenAlexW1972194169MaRDI QIDQ1431817FDOQ1431817
Authors: D. Massart 
Publication date: 11 June 2004
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2003.11.003
Recommendations
- 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
network flowsrandom utility modelBlock-Marschak inequalitiescomplete system of choice probabilitiesFalmagne theoremnormalization equalitiesprobabilistic preference theoryMöbius inversion
Characteristic functions; other transforms (60E10) Applications of statistics to psychology (62P15) Inequalities; stochastic orderings (60E15) Mathematical psychology (91E99)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- A course in combinatorics.
- The stochastic choice problem: A game-theoretic approach
- A representation theorem for finite random scale systems
- Title not available (Why is that?)
- Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
- Title not available (Why is that?)
Cited In (24)
- A representation theorem for finite best-worst random utility models
- What independent random utility representations are equivalent to the IIA assumption?
- Title not available (Why is that?)
- Extended formulations for order polytopes through network flows
- Dual random utility maximisation
- A lexicographic semiorder polytope and probabilistic representations of choice
- Branching-independent random utility model
- Methods for testing the random utility model
- Analysis of multinomial models under inequality constraints: applications to measurement theory
- Regular choice systems: a general technique to represent them by random variables
- Disentangling preferences and limited attention: random-utility models with consideration sets
- Prior distributions for random choice structures
- Confidence models of incomplete preferences
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Correlated choice
- Revealed preference domains from random choice
- Bayesian inference and model comparison for random choice structures
- Some probabilistic models of best, worst, and best --- worst choices
- Identification in the random utility model
- A correct response model in knowledge structure theory
- An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis
- Relations between best, worst, and best-worst choices for random utility models
- Regular random choice and the triangle inequalities
- Adjacencies on random ordering polytopes and flow polytopes
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)
