8 - Complexity
Published online by Cambridge University Press: 12 October 2009
Summary
Complexity is no argument against a theoretical approach if the complexity arises not out of the theory itself but out of the material which any theory ought to handle.
Frank Palmer, Grammar (Penguin, 1971)Uncertainty and complexity are opposite sides of the nescience coin. One who suffers from uncertainty is frustrated by a lack of knowledge; one who suffers from complexity is frustrated by a lack of know-how. Knowing what to do is one thing, but knowing how to do it is quite another thing. Even if one knows of a way, in principle, to solve a problem, the computational burden of the solution may be impossible with existing technology. In such cases the solution must await the development of improved methods of computation.
Apparent complexity can often be reduced by eliminating irrelevant attributes of the decision problem, a procedure that Rasmusen terms “no-fat modeling.” This approach is as follows: “First, a broad and important problem is introduced. Second, it is reduced to a very special but tractable model that hopes to capture its essence. Finally, in the most perilous part of the process, the results are expanded to apply to the original problem” (Rasmusen, 1989). Once the problem has been reduced to its essence, game theory provides a way to compute solutions to be expanded to the original problem.
- Type
- Chapter
- Information
- Satisficing Games and Decision MakingWith Applications to Engineering and Computer Science, pp. 169 - 204Publisher: Cambridge University PressPrint publication year: 2003