Computable Approaches to Rational Choice and Decision-Making
Files
Date
2021-01-05
Authors
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
Volume
Number/Issue
Starting Page
1415
Ending Page
Alternative Title
Abstract
The capacity of agents to act rationally, that is to make choices that positively reflect their interests, is a core assumption underlying democratic governance systems, microeconomics, decision science, market driven economies, and many agent based modeling efforts. In this paper we investigate axiomatic theories of rational choice from the perspective of computability. Using algorithmic complexity, we show highly general conditions under which no effective procedure can exist enabling these theories to identify sequences of choices as random. While axiomatic theories of rational choice yield powerful descriptions of choice behavior, this power comes at the expense of axioms which can be brittle with regard to computability limits.
Description
Keywords
Intelligent Decision Support for Logistics and Supply Chain Management, algorithmic complexity, axiomatic theories, computability, decision-making, rational choice
Citation
Extent
10 pages
Format
Geographic Location
Time Period
Related To
Proceedings of the 54th Hawaii International Conference on System Sciences
Related To (URI)
Table of Contents
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International
Rights Holder
Local Contexts
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.