Computable preference and utility

DOI10.1016/S0304-4068(98)00063-9zbMath0953.91004MaRDI QIDQ1961959

Marcel K. Richter, Kam-Chau Wong

Publication date: 30 January 2000

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

zbMATH Keywords

complexitypreferencebounded rationalityrecursive analysiscomputabilityutility representation

Mathematics Subject Classification ID

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

Related Items (3)

Competitive equilibrium with intuitionistic agents ⋮ Computability of simple games: A characterization and application to the core ⋮ The Nakamura numbers for computable simple games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recursive counterexample to Debreu's theorem on the existence of a utility function
• On effectively computable realizations of choice functions
• Preference and utility. A constructive development
• Computational complexity of real functions
• Non-computability of competitive equilibrium
• The constructive theory of preference relations on a locally compact space. II
• Non-computable strategies and discounted repeated games
• Computable functionals
• Learning Rational Expectations Under Computability Constraints
• Rationality, Computability, and Nash Equilibrium
• Recursive metric spaces

This page was built for publication: Computable preference and utility