Complexity: A Theoretical Analysis with Implications to Self Regulation and Goal Pursuit
50 Pages Posted: 6 May 2012 Last revised: 29 Jun 2015
Date Written: May 6, 2015
Abstract
We consider computational tasks that arise from the management of multiple goals. Building upon the field of computational complexity theory, we argue that multiple goals give rise to many computational problems that are intractable (namely, NP-hard) and unlikely to be solvable in reasonable amount of time. Our main thesis is that a major reason for failures to achieve goals is computational in nature and cannot be attributed to lack of motivation, will-power or self-control. We discuss implications as well as future directions regarding the connection between self-regulation, goal pursuit and computational hardness.
Keywords: Algorithms, Bounded Rationality, Computational Complexity, Goal Systems
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
Recommended Papers
-
Construal Levels and Self-Control
By Yaacov Trope, Kentaro Fujita, ...
-
Highbrow Films Gather Dust: Time-Inconsistent Preferences and Online DVD Rentals
By Katherine L. Milkman, Todd Rogers, ...
-
Future Lock-In: Future Implementation Increases Selection of 'Should' Choices
By Todd Rogers and Max H. Bazerman
-
By Katherine L. Milkman, Todd Rogers, ...
-
Values as Predictors of Judgments and Behaviors: The Role of Abstract and Concrete Mindsets
By Carlos J. Torelli and Andrew Kaikati
-
By Joanne Kane, A. Peter Mcgraw, ...
-
Relaxation Increases Monetary Valuations
By Michel Tuan Pham, Iris W. Hung, ...
-
Consumers Believe They Will Have More Control Over the Future than They Did Over the Past