Algorithm 1: Initial leader selector Group leader initialization

Input: $\mathcal{T},\mathcal{S},F,K$

Output: a set of $L\subset \mathcal{S},\left|\mathrm{L}\right|\le K$

Step 1: Initialization.

1. $L-0,F^{\ast }-0;$

Step 2.

2. While K ≠ 0 and $\mathcal{S}$ ≠ 0; do

3:  k∗ = $\underset{{\mathrm{s}}_k\in \mathcal{S}\backslash L}{arg max}\Delta \Phi \left({\mathrm{s}}_k\right)$

4:  if $\Delta \Phi \left({\mathrm{s}}_k\right)>0$, then

5:     $L-L\cup \left\{{\mathrm{s}}_{k^{\ast }}\right\}$

6:      $\mathcal{S}-\mathcal{S}\backslash \left\{{\mathrm{s}}_{k^{\ast }}\right\}$

7:      $F^{\ast }-F^{\ast }\cup \left\{{\mathrm{F}}_{k^{\ast }}\right\}$

8:      K = K − 1

9:   else

10:     $\mathcal{S}-\mathcal{S}\backslash \left\{{\mathrm{S}}_{k^{\ast }}\right\}$

11:  end if

12:end while

13:return to the leader set. $L$