名称：基于拍卖的网络服务商选择算法

1: for i = 1 to n do

2: ${\theta }_i\to \Theta$

3: end for

4: for j = 1 to m do

5: $b_i\to b$

6: end for

7: Calculating $X^{*}=\arg \underset{\mathrm{X}}{\min }{\displaystyle \sum _i{\displaystyle \sum _j\left({\lambda }_j{f}_{{\text{NSP}}_i}^j+y_{{\text{NSP}}_i}^j\times u_{{\text{NSP}}_i}^j\right)}}$

8: for i = 1 to n do

9: if $c{p}_{{\text{NSP}}_i}^{\text{real}}\le c{p}_{{\text{NSP}}_i}^{\text{allocation}}$ then

10: for k = 1 to r do

11: calculating $R_i$ , Using formula (7) and (8)

12: end for

13: end if

14: end for

15: for i = 1 to n do

16: Calculating $U_i\left(x_i,R_i,{\theta }_i\right)=R_i-C_i\left(x_i,{\theta }_i\right)-P_i$

17: end for