Resource Allocation Based on DEA and Non-Cooperative Game

Resource allocation is one of the most important applications of data envelopment analysis(DEA). Usually, the resource to be allocated is directly related to the interests of decision-making units(DMUs), thus the dynamic non-cooperative game is one of the representative behaviours in the allocation process. However, it is rarely considered in the previous DEA-based allocation studies,which may reduce the acceptability of the allocation plan. Therefore, this paper proposes a DEA-based resource allocation method considering the dynamic non-cooperative game behaviours of DMUs. The authors first deduce the efficient allocation set under the framework of variable return to scale(VRS)and build the allocation model subjecting to the allocation set. Then an iteration algorithm based on the concept of the non-cooperative game is provided for generating the optimal allocation plan.Several interesting characteristics of the algorithm are proved, including i) the algorithm is convergent,ii) the optimal allocation plan is a unique Nash equilibrium point, and iii) the optimal allocation plan is unique no matter which positive value the initial allocation takes. Some advantages of the allocation plan have been found. For example, the allocation plan is more balanced, has more incentives and less outliers, compared with other DEA-based allocation plans. Finally, the proposed method is applied to allocate the green credit among the 30 Chinese iron and steel enterprises, and the results highlight the applicability of the allocation method and solution approach. Therefore, the approach can provide decision makers with a useful resource allocation tool from the perspective of dynamic non-cooperative game.