Scott E. Page (Division of Humanities and Social Sciences 228-77, California Institute of Technology, Pasadena, CA 91125, USA)
Abstract
The paper constructs two measures of difficulty for functions defined over binary strings. The first of these measures, cover size, captures the difficulty of solving a problem in parallel. The second measure, ascent size, captures the difficulty of solving a problem sequentially. We show how these measures can help us to better understand the performance of genetic algorithms and simulated annealing, two widely used search algorithms. We also show how disparities in these two measures may shed light on the organizational structure of firms.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Article provided by Springer in its journal Economic Theory.
For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).
Related research
Keywords:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Massimo Egidi, 2002.
"Biases in human behavior,"
CEEL Working Papers
0205, Computable and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
[Downloadable!]
Luigi Maregno & Corrado Pasquali, 2008.
"A computational voting model,"
LEM Papers Series
2008/24, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy.
[Downloadable!]