A family of self-organizing systems

Front Cover
Cornell University, Center for Applied Mathematics, 1966 - Computers - 106 pages
0 Reviews
An investigation was made of a class of adaptive systems and the systems' behaviors as game-playing machines. Each member of the class is described by a set of parameters that specifies its reenforcement mechanism. In general, such a mechanism tends to increase successful strategies' probabilities of occurrence. However, the parameters must be carefully selected if the adaptive system's probability of winning is to approach one. The paper first develops a class of urn models, described by the same parameters; and shows that each urn model behaves very much like a corresponding adaptive system. The familiar urns of Polya and Barnard Friedman are members of this class. Other members exhibit much more interesting behaviors. The paper analyzes the urn models and proves a sufficient condition for convergence to one, with probability one, of the right-ball ratio. It exhibits numerical results showing that, for practical applications, the condition is also necessary. Finally, it analyzes the glitch phenomenon. (Author).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

Common terms and phrases

Bibliographic information