Computable preference and utility

DOI10.1016/S0304-4068(98)00063-9MaRDI QIDQ1961959zbMATH OpenFDO

Authors Marcel K. Richter, Kam-Chau Wong

Publication date 30 January 2000

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

Full work available at URL https://doi.org/10.1016/S0304-4068(98)00063-9

zbMATH Keywords

bounded rationalitycomplexitycomputabilitypreferencerecursive analysisutility representation

Mathematics Subject Classification ID

Individual preferences (91B08) Utility theory (91B16)

Recommendations

• Rationality, computability, and complexity
• scientific article; zbMATH DE number 4130139
• The constructive inequivalence of various notions of preference ordering
• The computational complexity of rationalizing behavior
• Computable economics: reconstructing the nonconstructive

Cites work

• A recursive counterexample to Debreu's theorem on the existence of a utility function
• Computable functionals
• Computational complexity of real functions
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3487161 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• scientific article; zbMATH DE number 530148 (Why is no real title available?)
• scientific article; zbMATH DE number 3230252 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3092990 (Why is no real title available?)
• Learning Rational Expectations Under Computability Constraints
• Non-computability of competitive equilibrium
• Non-computable strategies and discounted repeated games
• On effectively computable realizations of choice functions
• Preference and utility. A constructive development
• Rationality, Computability, and Nash Equilibrium
• Recursive metric spaces
• The constructive theory of preference relations on a locally compact space. II

Cited in

(6)

• The Nakamura numbers for computable simple games
• Definable utility in o-minimal structures.
• Computability of simple games: A characterization and application to the core
• Competitive equilibrium with intuitionistic agents
• Preferences (partial pre-orders) on complex numbers -- in view of possible use in quantum econometrics
• Recursiveness and preference orderings

This page was built for publication: Computable preference and utility

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