KMS Of Academy of mathematics and systems sciences, CAS
On computational complexity of membership test in flow games and linear production games | |
Fang, QZ; Zhu, SF; Cai, MC; Deng, XT | |
2002-09-01 | |
发表期刊 | INTERNATIONAL JOURNAL OF GAME THEORY |
ISSN | 0020-7276 |
卷号 | 31期号:1页码:39-45 |
摘要 | Let Gamma equivalent to (N . nu) be a cooperative game with the player set N and characteristic function nu : 2(N) --> R. An imputation of the game is in the core if no subset of players could gain advantage by splitting from the grand coalition of all players. It is well known that, for the flow game (and equivalently, for the linear production game), the core is always non-empty and a solution in the core can be found in polynomial time. In this paper, we show that, given an imputation x, it is NP-complete to decide x is not a member of the core, for the flow game. And because of the specific reduction we constructed, the result also holds for the linear production game. |
关键词 | flow game linear production game NP-complete |
语种 | 英语 |
WOS研究方向 | Business & Economics ; Mathematics ; Mathematical Methods In Social Sciences |
WOS类目 | Economics ; Mathematics, Interdisciplinary Applications ; Social Sciences, Mathematical Methods ; Statistics & Probability |
WOS记录号 | WOS:000178768600005 |
出版者 | PHYSICA-VERLAG GMBH & CO |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/17840 |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Fang, QZ |
作者单位 | 1.Ocean Univ Qingdao, Dept Math, Qingdao 266003, Peoples R China 2.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China 3.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Fang, QZ,Zhu, SF,Cai, MC,et al. On computational complexity of membership test in flow games and linear production games[J]. INTERNATIONAL JOURNAL OF GAME THEORY,2002,31(1):39-45. |
APA | Fang, QZ,Zhu, SF,Cai, MC,&Deng, XT.(2002).On computational complexity of membership test in flow games and linear production games.INTERNATIONAL JOURNAL OF GAME THEORY,31(1),39-45. |
MLA | Fang, QZ,et al."On computational complexity of membership test in flow games and linear production games".INTERNATIONAL JOURNAL OF GAME THEORY 31.1(2002):39-45. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论