Algorithm 1: Cooperative-Bargaining Power-Scheduling Algorithm

1:  Initialization: MeNBm and SeNBn, m∈M, n∈N, choose power levels pm(0) and pn(0); predefine the coefficients αm, βm, αn, and βn; predefine the Lagrangian parameters ${\lambda }_m^{\left(t\right)}$ and${\lambda }_n^{\left(t\right)}$ at step t.

2:  for each SUE of each SeNBn do

3:  gather the CINR: $h_{n,j}=\frac{{\gamma }_{n,j}}{p_n(t)}$

4:  end for

5:  So $h_n={\displaystyle \sum _{j=1}^J{h}_{n,j}}$

6:  while not $\left|p_m^{(t+1)}-p_m^{(t)}\right|\le \theta$ for any small $\theta$ do

7:  adjust MeNBm ‘s power at the next step (t + 1) by: $p_m^{(t+1)}=\frac{1-{\alpha }_m-{\beta }_m}{{\displaystyle \sum _{n=1}^N{\displaystyle \sum _{j=1}^J\frac{g_{m,\{n,j\}}}{g_{n,j}}\frac{h_{n,j}^2}{h_n}+{\lambda }_m^{(t)}}}}$

8:  update ${\lambda }_m^{\left(t+1\right)}$ by MeNBm as: ${\lambda }_m^{(t+1)}={\lambda }_m^{(t)}-{\beta }_m^{(t)}(p_m^{MAX}-p_m^{(t)})$

9:  end while

10: for each MUE of each MeNBm do

11:  gather the CINR: $h_{m,i}=\frac{{\gamma }_{m,i}}{p_m(t)}$

12: end for

13: So $h_m={\displaystyle \sum _{i=1}^I{h}_{m,i}}$

14: while not $\left|p_n^{(t+1)}-p_n^{(t)}\right|\le \theta$ for any small $\theta$ do

15:  adjust SeNBn ‘s power at the next step (t + 1) by: $p_n^{(t+1)}=\frac{1-{\alpha }_n-{\beta }_n}{{\displaystyle \sum _{m=1}^M{\displaystyle \sum _{i=1}^I\frac{g_{n,\{m,i\}}}{g_{m,i}}\frac{h_{m,i}^2}{h_m}+{\lambda }_n^{(t)}}}}$

16:  update ${\lambda }_n^{\left(t+1\right)}$ by SeNBn as: ${\lambda }_n^{(t+1)}={\lambda }_n^{(t)}-{\beta }_n^{(t)}(p_n^{MAX}-p_n^{(t)})$

17: end while