A short proof of a theorem of Falmagne.

DOI10.1016/j.jmp.2003.11.003zbMath1053.60009MaRDI QIDQ1431817

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

zbMATH Keywords

Möbius inversion; network flows; random utility model; Block-Marschak inequalities; complete system of choice probabilities; Falmagne theorem; normalization equalities; probabilistic preference theory

Mathematics Subject Classification ID

60E15: Inequalities; stochastic orderings

60E10: Characteristic functions; other transforms

91E99: Mathematical psychology

62P15: Applications of statistics to psychology

Related Items

A lexicographic semiorder polytope and probabilistic representations of choice, Analysis of multinomial models under inequality constraints: applications to measurement 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

Cites Work

• The stochastic choice problem: A game-theoretic approach
• A representation theorem for finite random scale systems
• Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item