Covers
- Creators
- Page, Scott E.
Abstract
This paper introduces the theory of covers for functions defined over binary variables. Covers formalize the notion of decomposability. Large complex problems are decomposed into subproblems each containing fewer variables, which can then be solved in parallel. Practical applications of the benefits from decomposition include the parallel architecture of supercomputers, the divisionalization of firms, and the decentralization of economic activity. In this introductory paper, we show how covers also shed light on the choice among public projects with complementarities. Further, covers provide a measure of complexity/decomposability with respect to contour sets, allowing for nonlinear effects which occur near the optimum to receive more weight than nonlinear effects arbitrarily located in the domain. Finally, as we demonstrate, covers can be used to analyze and to calibrate search algorithms.
Additional Information
The author would like to thank Stan Reiter, David Richardson, and Jim Jordan for their insights.Attached Files
Submitted - sswp872.pdf
Files
Name | Size | Download all |
---|---|---|
md5:93b0ff89756e547a071342fde8a1ce83
|
849.0 kB | Preview Download |
Additional details
- Eprint ID
- 80739
- Resolver ID
- CaltechAUTHORS:20170823-141457013
- Created
-
2017-08-28Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Social Science Working Papers
- Series Name
- Social Science Working Paper
- Series Volume or Issue Number
- 872