Good friends are hard to find!

被引：1
|
作者：
Brihaye, Thomas [1 ]
Ghannem, Mohamed [2 ]
Markey, Nicolas [3 ,4 ]
Rieg, Lionel [5 ]
机构：
[1] Univ Mons, Inst Math, B-7000 Mons, Belgium
[2] Univ La Manouba, ENSI, Manouba, Tunisia
[3] ENS Cachan, LSV, F-75700 Paris, France
[4] CNRS, F-75700 Paris, France
[5] ENS Lyon, Dept Informat, Paris, France
来源：
TIME 2008: 15TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/TIME.2008.10
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We focus on the problem of finding (the size of) a minimal winning coalition in a multi-player game. We prove that deciding whether there is a winning coalition of size at most k is NP-complete, while deciding whether k is the optimal size is DP-complete. We also study different variants of our original problem: the function problem, where the aim is to effectively compute the coalition; more succinct encoding of the game; and richer families of winning objectives.
引用
收藏
页码：32 / +
页数：3
相关论文
共 50 条
12345