摘要
覆盖对策是建立在最优集合覆盖问题基础上的合作对策模型.研究覆盖对策的核心稳定性.基于线性规划对偶理论,给出了一定条件下覆盖对策核心的刻划及其具有稳定核心的充要条件,并将结果应用到若干具体的对策模型中.
This paper focuses on the core stability of covering games, which arise from minimum set cover problems. Based on duality theory of linear programming, a characterization of the core is given and a sufficient and necessary condition is proposed on the core stability of a covering game under KSnig Condition. These results can be applied to some concrete covering games.
出处
《系统科学与数学》
CSCD
北大核心
2008年第11期1323-1330,共8页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(10771200)
新世纪优秀人才支持计划(05-0598)资助项目.
