DocumentCode
1958615
Title
Good Friends are Hard to Find!
Author
Brihaye, Thomas ; Markey, Nicolas ; Ghannem, Mohamed ; Rieg, Lionel
Author_Institution
Inst. de Math., Univ. Mons-Hainaut, Mons
fYear
2008
fDate
16-18 June 2008
Firstpage
32
Lastpage
40
Abstract
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 HP-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.
Keywords
computational complexity; formal logic; formal verification; game theory; temporal logic; DP-complete coalition; HP-complete coalition; minimal winning coalition; multiplayer game; Automata; Automatic control; Control systems; Costs; Electrical equipment industry; Encoding; Logic; Mathematical model; Open systems; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on
Conference_Location
Montreal, QC
ISSN
1530-1311
Print_ISBN
978-0-7695-3181-6
Type
conf
DOI
10.1109/TIME.2008.10
Filename
4553288
Link To Document