A short proof of a theorem of Falmagne. (Q1431817): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Neculai Curteanu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Neculai Curteanu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jmp.2003.11.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972194169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3274477 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A representation theorem for finite random scale systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The stochastic choice problem: A game-theoretic approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871778 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2755077 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:49, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A short proof of a theorem of Falmagne. |
scientific article |
Statements
A short proof of a theorem of Falmagne. (English)
0 references
11 June 2004
0 references
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.
0 references
Falmagne theorem
0 references
probabilistic preference theory
0 references
complete system of choice probabilities
0 references
random utility model
0 references
Block-Marschak inequalities
0 references
normalization equalities
0 references
Möbius inversion
0 references
network flows
0 references