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.
机构:Augustana Coll, Business Adm, Rock Isl, IL 61201 USA
Geer, Daniel E., Jr.
Conway, Daniel G.
论文数: 0引用数: 0
h-index: 0
机构:
Augustana Coll, Business Adm, Rock Isl, IL 61201 USA
Univ Notre Dame, Notre Dame, IN 46556 USA
Indiana Univ, Bloomington, IN 47405 USAAugustana Coll, Business Adm, Rock Isl, IL 61201 USA