一类2人合作交叉规划的s-最优联合解

s-Optimal Joint Solutions for Two-Person Cooperative Interaction Programming

提出并研究了一类 2人合作交叉规划问题。引进了具有相同联合值的s 最优联合解 ,它作为 2人合作交叉规划的一种公平解 ,比Nash均衡解要更好 ,并得到了它的若干有关性质 ,证明了可以通过求解一个等价的数学规划问题的最优解来作为交叉规划的s 最优联合解。最后 ,讨论了具有不同联合值的s 最优联合解。 2人合作交叉规划可以广泛用于讨论许多具有或不具有冲突的多人决策问题 ,如生产计划控制、工程、计算机等领域中的网络冲突问题。

In this paper, we present and study a class of two person cooperative interaction programming (CIP). First, we define a new type of solutions, called s optimal coalition solutions with the same joint value. It is better than Nash equilibrium solution in the equity among decision makers. We obtain some basic results and show that an s optimal joint solution can be obtained by solving a mathematical programming. Finally, we discuss the s optimal joint solutions with different coalition values. CIP can be widely applied in many practical areas with or without conflicts, such as the control of production planning, and network conflicts in engineering and computer fields.\;