基于演化博弈的资源服务组合

Input:

服务需求方参与合作的资源比例y

服务需求方不参与合作的资源比例1-y

服务响应方参与合作的资源比例x

服务响应方不参与合作的资源比例1-x

服务需求方基础收益BaCI

服务需求方合作收益RaCI

服务需求方协作收益ECa

服务需求方惩罚收益PFa

服务需求方基础收益BbCI

服务需求方合作收益RbCI

服务需求方协作收益ECb

服务需求方惩罚收益PFb

博弈次数 m

Output 最大收益 res[2][n]

for auto i : m

for auto i : n

for auto j:n

$\begin{array}{c}\text{d}\left(\text{i}\right)=y\cdot \left[x\cdot \left(R_{i}BI+R_{i}CI+E{C}_i-R_{i}CC\right)+\left(1-x\right)\cdot \left(R_{i}BI+E{C}_i-R_{i}CC\right)\right]\\ +\left(1-y\right)\cdot \left[x\cdot \left(R_{i}BI-P{F}_i\right)+\left(1-x\right)\cdot R_{i}BI\right]\end{array}$

$\begin{array}{c}\text{p}\left(\text{j}\right)=x\cdot \left[y\cdot \left(R_{i}BI+R_{i}CI+E{C}_i-R_{i}CC\right)+\left(1-y\right)\cdot \left(R_{i}BI+E{C}_i-R_{i}CC\right)\right]\\ +\left(1-x\right)\cdot \left[y\cdot \left(R_{i}BI-P{F}_i\right)+\left(1-y\right)\cdot R_{i}BI\right]\end{array}$

serviceRequest(i) = d(i);

serviceResponse(j) = p(j);

end

end

end

if d(i) < $\frac{R_{B}CC-R_{B}L\cdot R_{B}CI/\left(R_{B}CI+R_{B}BI\right)}{R_{B}CI+P{F}_B}$ && p(i) < $\frac{R_{A}CC-R_{A}L\cdot R_{A}CI/\left(R_{A}CI+R_{A}BI\right)}{R_{A}CI+P{F}_A}$

res[0][i] = RaBI

res[1][j] = RbBI

return max(res[0][i]+res[1][j])

sort(serviceRequest(n))

sort(serviceResponse(n))

bool cooperationStrategy = Game(serviceRequest(i) , serviceResponse(j))

if(cooperationStrategy)

output i,j

else

i = i + 1 or j = j + 1

return max(res[0][i]+res[1][j])