覆盖对策的核心稳定性条件

方奇志

系统科学与数学 ›› 2008, Vol. 28 ›› Issue (11) : 1323-1330.

PDF(347 KB)
中国科学院数学与系统科学研究院期刊网
PDF(347 KB)
系统科学与数学 ›› 2008, Vol. 28 ›› Issue (11) : 1323-1330. DOI: 10.12341/jssms10147
论文

覆盖对策的核心稳定性条件

    方奇志
作者信息 +

Conditions on Core Stability of Covering Games

    FANG Qizhi
Author information +
文章历史 +

摘要

覆盖对策是建立在最优集合覆盖问题基础上的合作对策模型.
研究覆盖对策的核心稳定性. 基于线性规划对偶理论,
给出了一定条件下覆盖对策核心的刻划及其具有稳定核心的充要条件,
并将结果应用到若干具体的对策模型中.

Abstract

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 K\"{o}nig Condition. These
results can be applied to some concrete covering games.

关键词

集合覆盖 / 核心 / 稳定集 / 核心稳定性 / 对偶定理.

Key words

Set cover / core / stable set / core stability / LP duality

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
方奇志. 覆盖对策的核心稳定性条件. 系统科学与数学, 2008, 28(11): 1323-1330. https://doi.org/10.12341/jssms10147
FANG Qizhi. Conditions on Core Stability of Covering Games. Journal of Systems Science and Mathematical Sciences, 2008, 28(11): 1323-1330 https://doi.org/10.12341/jssms10147
中图分类号： 05C70，91A12   
PDF(347 KB)

197

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉