Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Completeness and Transitivity of Preferences on Mixture Sets (1810.02454v1)

Published 4 Oct 2018 in econ.TH

Abstract: In this paper, we show that the presence of the Archimedean and the mixture-continuity properties of a binary relation, both empirically non-falsifiable in principle, foreclose the possibility of consistency (transitivity) without decisiveness (completeness), or decisiveness without consistency, or in the presence of a weak consistency condition, neither. The basic result can be sharpened when specialized from the context of a generalized mixture set to that of a mixture set in the sense of Herstein-Milnor (1953). We relate the results to the antecedent literature, and view them as part of an investigation into the interplay of the structure of the choice space and the behavioral assumptions on the binary relation defined on it; the ES research program due to Eilenberg (1941) and Sonnenschein (1965), and one to which Schmeidler (1971) is an especially influential contribution.

Summary

We haven't generated a summary for this paper yet.