Cooperative Problem Solving

» T. Hogg and B. A. Huberman, Better Than the Best: The Power of Cooperation, 1993
Cooperative problem solving is a powerful method for approaching difficult problems. This paper describes two computational search examples for which cooperative parallel search is effective for hard problem instances (cryptarithmetic and graph coloring).

For discussions of the individual examples see: » S. Clearwater, B. Huberman and T. Hogg, Cooperative Problem Solving, 1992 cryptarithmetic » T. Hogg and C. P. Williams, Solving the Really Hard Problems with Cooperative Search, 1993 graph coloring

» D. C. Parkes and B. A. Huberman, Adaptive Portfolio Selection by Investment Groups, 1997
Cooperation among individuals can also lead to better market performance.