Algorithm 2 Iterative Algorithm Based on Dinkelbach

Input: $\xi ,D_i^g,R_{i,g}^k,\text{iter\_max},ϵ,i\in \mathcal{I},g\in \mathcal{G}$. Initialization: ${\lambda }_{i,g}^{\mathrm{iter},k}=0,\mathrm{iter}=1$. 1:while  $F\left({\lambda }_{i,g}^{\mathrm{iter},k}\right)>ϵ$  or  $\mathrm{iter}\le \text{iter\_max}$  do 2:   $F\left({\lambda }_{i,g}^{\mathrm{iter},k}\right)=D_i^g-{\lambda }_{i,g}^{\mathrm{iter},k}{\displaystyle \frac{R_{i,g}^k}{\xi }}$ 3:   $\mathrm{iter}=\mathrm{iter}+1$ 4:   ${\lambda }_{i,g}^{\mathrm{iter},k}=\xi {\displaystyle \frac{D_i^g}{R_{i,g}^k}}$ 5:end while Output: Obtain ${\lambda }_{i,g}^k={\lambda }_{i,g}^{\mathrm{iter},k}$.