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

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.\;