Research on Dynamic Task Allocation Algorithm to Improve User Participation in the Witkey Mode
Algorithm 1
TAACWP.
import: ,,
Output: the maximum total system revenue and its counterpart.
(1)
FOR
(2)
Use the “intermediary recruitment algorithm” for a round of task assignment.
(3)
Record the system benefits at the moment .
(4)
FOR
(5)
Save all Witkey’s current task selection status .
(6)
FOR
(7)
FOR
(8)
Witkey selects tasks and provides skills .
(9)
All others, except Witkey i, adopt the optimal reaction strategy selection task in turn in the order of integration from large to small, and the results of guiding two consecutive rounds of the optimal reaction are exactly the same.
(10)
Record the new system benefits.
(11)
END FOR
(12)
END FOR
(13)
IF
(14)
(15)
ELSE
(16)
Restore the task selection status for all Witkey customers.
(17)
END IF
(18)
END FOR
(19)
Update data for Witkey and tasks: Remove tasks that are beyond the “maximum waiting time”, add new tasks and new customers, and update Witkey's points, skills, and other information.
