2019
DOI: 10.1016/j.mathsocsci.2019.03.004
|View full text |Cite
|
Sign up to set email alerts
|

Completeness and transitivity of preferences on mixture sets

Abstract: In this paper, we show that the presence of the Archimedean and the mixturecontinuity 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 (195… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
6
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 49 publications
1
6
0
Order By: Relevance
“…Uzawa (1960) pioneered this line of research by showing that convexity of a complete preference relation defined on a convex subset of a topological vector space with closed upper sections and a transitive asymmetric part implies that the relation itself is transitive. This result is reproduced and generalized by Sonnenschein (1965, Theorems 5 and 6) and picked up by Galaabaatar, Khan, and Uyanık (2018).…”
Section: Sen's Deconstruction Of the Transitivity Postulatesupporting
confidence: 63%
See 2 more Smart Citations
“…Uzawa (1960) pioneered this line of research by showing that convexity of a complete preference relation defined on a convex subset of a topological vector space with closed upper sections and a transitive asymmetric part implies that the relation itself is transitive. This result is reproduced and generalized by Sonnenschein (1965, Theorems 5 and 6) and picked up by Galaabaatar, Khan, and Uyanık (2018).…”
Section: Sen's Deconstruction Of the Transitivity Postulatesupporting
confidence: 63%
“…Uzawa (1960) pioneered this line of research by showing that convexity of a complete preference relation defined on a convex subset of a topological vector space with closed upper sections and a transitive asymmetric part implies that the relation itself is transitive. This result is reproduced and generalized by Sonnenschein (1965, Theorems 5 and 6) and picked up by Galaabaatar, Khan, and Uyanık (2018). 33 Note that to say that the symmetric part of a relation is complete renders the relation trivial, whereas to say that the asymmetric part is complete furnishes the contradiction that an element of the space is preferred to itself.…”
Section: Sen's Deconstruction Of the Transitivity Postulatementioning
confidence: 70%
See 1 more Smart Citation
“…23 In addition to the notion of the up-and-down function abstracted into a binary relation, Section 3 can also be viewed as an abstraction of the notion of equality into an equivalence relation, and it is this that facilitates the formulation of the solvability and restricted solvability properties. This section then turns to the discipline that gave rise to measurement and decision theory: 24 Section 4 turns to the new material as categorized under extensions and use of the IVP for functions separately from binary relations, and summarized in four portmanteau theorems, and two main Propositions. 25 Section 5 is devoted to the proofs.…”
Section: Introductionmentioning
confidence: 99%
“…This is to say, they focused their attention on the mixing operation, rather than on the objects of choice itself. Wold (1943-44) used a similar scalar-continuity property in his work, but with an additional monotonicity assumption; also see Fishburn (1982), Wakker (1989), Bridges and Mehta (1995), Herden and Pallack (2001) and Candeal, Induráin and Molina (2012), Galaabaatar, Khan and Uyanık (2019) on numerical representation of preferences. In addition to this parametrized topological setting, we also mention for the record, a third setting, that involves no topology at all, but constrains itself to a purely algebraic structure.…”
Section: Introductionmentioning
confidence: 99%