Lexicographic behaviour of chains

DOI10.1007/S000130050315zbMath0924.06001OpenAlexW2066211746MaRDI QIDQ1291138

Esteban Induráin, Juan Carlos Candeal

Publication date: 30 June 1999

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000130050315

zbMATH Keywords

utility functionslexicographic productlexicographic decompositionnumerical representations of chainsplanar chain

Mathematics Subject Classification ID

Utility theory (91B16) Total orders (06A05)

Related Items (12)

Universal semiorders ⋮ Lexicographic preference representation: intrinsic length of linear orders on infinite sets ⋮ Definable linear orders definably embed into lexicographic orders in o-minimal structures ⋮ The representability number of a chain ⋮ Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result. ⋮ UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS ⋮ A survey on the mathematical foundations of axiomatic entropy: representability and orderings ⋮ Pointwise Debreu lexicographic powers ⋮ Lexicographic decomposition of chains and the concept of a planar chain ⋮ Numerical representability of semiorders ⋮ The non-existence of a utility function and the structure of non-representable preference relations ⋮ Topologies generated by nested collections

This page was built for publication: Lexicographic behaviour of chains