Accession Number : AD0644928

Title :   A FAMILY OF SELF-ORGANIZING SYSTEMS,

Corporate Author : CORNELL UNIV ITHACA N Y CENTER FOR APPLIED MATHEMATICS

Personal Author(s) : Agnew,Palmer W.

Report Date : NOV 1966

Pagination or Media Count : 68

Abstract : 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)

Descriptors :   (*ADAPTIVE SYSTEMS, *GAME THEORY), (*LEARNING MACHINES, ADAPTIVE SYSTEMS), PROBABILITY, STATISTICAL PROCESSES

Subject Categories : Statistics and Probability
      Bionics

Distribution Statement : APPROVED FOR PUBLIC RELEASE