Universal semiorders
From MaRDI portal
Publication:313082
DOI10.1016/j.jmp.2016.05.001zbMath1396.91112OpenAlexW4255206415MaRDI QIDQ313082
Alfio Giarlotta, W. Stephen Watson
Publication date: 9 September 2016
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2016.05.001
traceinterval ordersemiorder\(\mathbb{Z}\)-line\(\mathbb{Z}\)-productorder-dimensionScott-suppes representationsliced trace
Related Items (9)
\((m, n)\)-rationalizable choices ⋮ Strict \((m, 1)\)-Ferrers properties ⋮ Well-graded families of NaP-preferences ⋮ Congruence relations on a choice space ⋮ Necessary and possible indifferences ⋮ A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem ⋮ Unit representation of semiorders. I: Countable sets ⋮ Unit representation of semiorders. II: The general case ⋮ The intermediate value theorem and decision-making in psychology and economics: an expositional consolidation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((m, n)\)-rationalizable choices
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Real interval representations
- Normalized and strict NaP-preferences
- Continuous representability of semiorders
- Pointwise Debreu lexicographic powers
- Interval graphs and interval orders
- Continuous semiorder representations
- Similarity and decision-making under risk (Is there a utility theory resolution to the Allais paradox?)
- Some representation problems for semiorders
- On JND representations of semiorders
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Numerical representations of imperfectly ordered preferences (A unified geometric exposition)
- The dimension of semiorders
- The Scott-Suppes theorem on semiorders
- Lexicographic behaviour of chains
- Interval choice: Classic and general cases
- Well-graded families of relations
- Semiorders. Properties, representations, applications
- Lexicographic orders and preference representation
- The non-existence of a utility function and the structure of non-representable preference relations
- Representable lexicographic products
- The representability number of a chain
- Representations of preference orderings
- Numerical representability of semiorders
- Necessary and possible preference structures
- A hierarchy of chains embeddable into the lexicographic power \(({\mathbb{R}}^\omega,\prec_{\text{lex}})\)
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- A genesis of interval orders and semiorders: transitive NaP-preferences
- Semiorders and risky choices
- Intransitive indifference with unequal indifference intervals
- Interval representations for interval orders and semiorders
- Learning Spaces
- Semiorders and a Theory of Utility Discrimination
- Foundational aspects of theories of measurement
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Knowledge Spaces
- Revealed Preference Theory
- Utility Functions for Partially Ordered Topological Spaces
- Utility Maximization, Choice and Preference
- Numerical representations of interval orders
This page was built for publication: Universal semiorders