Collectives for the Optimal Combination of Imperfect Objects

In this letter we summarize some recent theoretical work on the design of collectives, i.e., of systems containing many agents, each of which can be viewed as trying to maximize an associated private utility, where there is also a world utility rating the behavior of that overall system that the designer of the collective wishes to optimize. We then apply algorithms based on that work on a recently suggested testbed for such optimization problems. This is the problem of finding the combination of imperfect nano-scale objects that results in the best aggregate object. We present experimental results showing that these algorithms outperform conventional methods by more than an order of magnitude in this domain.

[1]  P. M. Hui,et al.  Volatility and agent adaptability in a self-organizing market , 1998, cond-mat/9802177.

[2]  Peter Dayan,et al.  Q-learning , 1992, Machine Learning.

[3]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[4]  Andrew G. Barto,et al.  Improving Elevator Performance Using Reinforcement Learning , 1995, NIPS.

[5]  Kagan Tumer,et al.  Using Collective Intelligence to Route Internet Traffic , 1998, NIPS.

[6]  Damien Challet,et al.  Optimal combinations of imperfect objects. , 2002, Physical review letters.

[7]  Kagan Tumer,et al.  Optimal Payoff Functions for Members of Collectives , 2001, Adv. Complex Syst..

[8]  Kagan Tumer,et al.  Improving Search Algorithms by Using Intelligent Coordinates , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Yicheng Zhang.  Modeling Market Mechanism with Evolutionary Games , 1998, cond-mat/9803308.

[10]  Kagan Tumer,et al.  Collective Intelligence and Braess' Paradox , 2000, AAAI/IAAI.