结合数据包络分析(DEA)与Nash讨价还价博弈模型研究有限资源的合理配置问题。首先证明,在投入约束条件下,基于传统DEA模型的资源配置方法将陷入困境。为此,需要考虑各决策单元(DMU)对于有限资源的竞合关系,引入Nash讨价还价博弈模型,并证明最优资源配置方案具有唯一性。最终通过算例说明了本方法的合理性与可行性,与其它DEA分摊方法相比还具有一定优势。 Combining data envelopment analysis (DEA) and Nash bargaining game model to study the reasonable allocation of limited resources. First of all, we prove that under the input constraints, the method of resource allocation based on the traditional DEA model will be in trouble. Therefore, it is necessary to consider the competing relationship of DMUs for limited resources, introduce the Nash bargaining game model, and prove that the optimal resource allocation scheme is unique. Finally, an example is given to illustrate the rationality and feasibility of the method, which has some advantages over other DEA methods.