Lexicographic preference representation: intrinsic length of linear orders on infinite sets
From MaRDI portal
Publication:6170023
DOI10.1016/j.jmateco.2023.102823zbMath1521.91082OpenAlexW4319788492MaRDI QIDQ6170023
Publication date: 15 August 2023
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmateco.2023.102823
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preference, topology and measure
- A million answers to twenty questions: choosing by checklist
- Nonstandard utilities for lexicographically decomposable orderings
- Two preference metrics provide settings for the study of properties of binary relations
- Debreu-like properties of utility representations
- Pointwise Debreu lexicographic powers
- Set theory. An introduction to independence proofs
- Lexicographic behaviour of chains
- A representation for topologically separable chains
- 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
- The Debreu Gap Lemma and some generalizations
- Lexicographic compositions of multiple criteria for decision making
- Orthogonal countable linear orders
- 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.
- Einbettungssätze für totalgeordnete Mengen
- Einbettung totalgeordneter Mengen in lexikographische Produkte
- The lexicographic complexity of asymmetric binary relations
- Embedding linearly ordered sets in real lexicographic products
- Isomorphisms of Lexicographic Powers of the Reals
- Utility Theory
- Lexicographic exponentiation of chains
