Nonstandard utilities for lexicographically decomposable orderings

DOI10.1016/J.JMATECO.2015.06.012MaRDI QIDQ745010zbMATH OpenOpenAlexFDO

Authors Davide Rizza

Publication date 12 October 2015

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://ueaeprints.uea.ac.uk/id/eprint/65187/1/Revised_paper_for_JEM.pdf

zbMATH Keywords

utilitynonstandard analysislexicographic ordering

Mathematics Subject Classification ID

Individual preferences (91B08) Utility theory (91B16) Nonstandard analysis (26E35)

Recommendations

• Pointwise Debreu lexicographic powers
• Lexicographic behaviour of chains
• Elementary non-Archimedean utility theory
• Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
• Utility functions on chains

Cites work

• scientific article; zbMATH DE number 3981120 (Why is no real title available?)
• scientific article; zbMATH DE number 3473519 (Why is no real title available?)
• scientific article; zbMATH DE number 3482337 (Why is no real title available?)
• scientific article; zbMATH DE number 3092990 (Why is no real title available?)
• scientific article; zbMATH DE number 3092991 (Why is no real title available?)
• Elementary non-Archimedean utility theory
• Expected qualitative utility maximization
• Lexicographic decomposition of chains and the concept of a planar chain
• Non-nonstandard analysis: Real infinitesimals
• Non-standard analysis
• Nonstandard nontransitive utility on mixture sets
• Second-order non-nonstandard analysis
• The non-existence of a utility function and the structure of non-representable preference relations

Cited in

(5)

• The existence and the non-existence of utility functions in order-theoretic, algebraic and topological environments
• Pointwise Debreu lexicographic powers
• Spatial-domain fitness landscape analysis for combinatorial optimization
• Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
• Lexicographic preference representation: intrinsic length of linear orders on infinite sets

This page was built for publication: Nonstandard utilities for lexicographically decomposable orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745010)