覆盖对策模型的均衡性  

Balancedness of Covering Games

作　　者：张丽超[1] 孔亮[2] 刘岩[2] 邸聪娜[2] 

机构地区：[1]燕山大学里仁学院基础教学部,河北秦皇岛066004 [2]河北科技师范学院数理系

出　　处：《河北科技师范学院学报》2009年第3期44-46,共3页Journal of Hebei Normal University of Science & Technology

摘　　要：研究了覆盖合作对策模型的均衡性。基于线性规划对偶理论,证明了覆盖对策均衡性的等价条件:覆盖对策是均衡的当且仅当其对应线性规划松弛有整数最优解,并且此时核心就是对偶规划的最优解集。The problem of balancedness for covering games is studied in this paper. The authors prove a necessary and sufficient condition on the balancedness of covering games based on duality theory of linear programming. That is, a covering game is balanced if and only if the corresponding linear program relaxation has integer optimal solutions, and in such case, the set of dual optimal solutions is exactly the core of the game.

关 键 词：对策论 核心 对策均衡性 对偶定理 

分 类 号：O225[理学—运筹学与控制论] O157.6[理学—数学]