(a) Agent Aj ranks tasks their profitability value (P / Y) starting with the most profitable;
(b) The agent Aj looks for the next task from the list. If the list is empty, then go to step 4;
(c) Agent Aj receives parameters of agents in community and number of agents N;
(d) If N = M, the agent go to step 3b;
(e) Agent figures out if community have enough CNs to solve task in user-specified time using the
following formula