Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Complexity of the Decisive Problem in Simple, Regular and
  Weighted Games   We study the computational complexity of an important property of simple,
regular and weighted games, which is decisiveness. We show that this concept
can naturally be represented in the context of hypergraph theory, and that
decisiveness can be decided for simple games in quasi-polynomial time, and for
regular and weighted games in polynomial time. The strongness condition poses
the main difficulties, while properness reduces the complexity of the problem,
especially if it is amplified by regularity. On the other hand, regularity also
allows to specify the problem instances much more economically, implying a
reconsideration of the corresponding complexity measure that, as we prove, has
important structural as well as algorithmic consequences.

15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th