Method of Implementing an Associate Referral Compensation System with a 1.5-ary hierarchical rooted tree

摘要

In a 1.5-ary hierarchical rooted tree compensation-based referral marketing system, each associate in the tree has one whole associate spot and one half associate spot in a subordinate tier of the tree. New associate referrals are places into the upmost, leftmost open spot in the tree. Referrals are either placed into a whole spot downline of the referring associate, or into two half spots downline of the referring associate, depending on whether the upmost, leftmost unoccupied associate spot is a whole spot or a half spot. Referrals by an associate in two half spots alternate downline of the two half spots occupied by the referrer. Associates in whole spots earn each commissions earned by each downline associate, and associates in two half spots earn half commission for each associate downline of both half spots.

主权项

1. A method of implementing an associate referral compensation system with a 1.5-ary hierarchical rooted tree comprises the steps of:
providing a hierarchal associate tree comprising a plurality of associate spots arranged into a plurality of tiers; wherein each tier comprises at least one associate spot, wherein an associate spot is occupied if an associate is assigned to the associate spot, wherein any arbitrary associate spot from the plurality of associate spots on an arbitrary tier is associated with a whole associate spot and a half associate spot from the plurality of associate spots on a subsequent tier, wherein the subsequent tier is subordinate to the arbitrary tier in the hierarchical associate tree, wherein the whole associate spot and the half associate spot of the subsequent tier are downline of the arbitrary associate spot; and wherein subsequent associate spots associated with the whole associate spot and the half associate spot are downline from the arbitrary associate spot; providing a primary tier and a plurality of subordinate tiers from the plurality of tiers, wherein a primary associate is assigned to a primary associate spot in the primary tier, and wherein the plurality of subordinate tiers is sequentially subordinate to the primary tier in the hierarchical associate tree; (A) identifying a new associate as being associated with an arbitrary associate, wherein the arbitrary associate is assigned to an arbitrary associate spot; (B) searching the hierarchical associate tree downline of the arbitrary associate spot to find an unoccupied associate spot; (C) assigning the new associate to the unoccupied associate spot, if the unoccupied associate spot is found, and if the unoccupied associate spot is a whole associate spot; (D) repeating step (B) to find a second unoccupied half associate spot, if the unoccupied associate spot is found, and if the unoccupied associate spot is a first unoccupied half associate spot; and (E) assigning a first half of the new associate to the first unoccupied half associate spot and a second half of the new associate to the second unoccupied half associate spot, if the first unoccupied half associate spot and the second unoccupied half associate spot are found.