Lotto-type competitive learning and its stability
Anson M. Y. Luk, Sandra Lien · 2003
This paper introduces a generalised idea of lotto-type competitive learning (LTCL), where one or move winners exist. The winners are divided into tiers, with each tier being rewarded differently. All losers are penalised equally. A set of dynamic LTCL equations is then introduced to assist in the study of the stability of the simplified idea of LTCL. It is shown that if a K-orthant exists in the LTCL state space, which is an attracting invariant set of the network flow, it will converge to a fixed point.