human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "complexity of comparison of influence of players in simple games"
  Abstract: Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The possible representations of simple games considered are simple games represented by winning coalitions, minimal winning coalitions, weighted voting game or a multiple weighted voting game. The influence of players is gauged from the viewpoint of basic player types, desirability relations and classical power indices such as Shapley-Shubik index, Banzhaf index, Holler index, Deegan-Packel index and Chow parameters. Among other results, it is shown that for a simple game represented by minimal winning coalitions, although it is easy to verify whether a player has zero or one voting power, computing the Banzhaf value of the player is #P-complete. Moreover, it is proved that multiple weighted voting games are the only representations for which it is NP-hard to verify whether the game is linear or not. For a simple game with a set W^m of minimal winning coalitions and n players, a O(n.|W^m|+(n^2)log(n)) algorithm is presented which returns `no' if the game is non-linear and returns the strict desirability ordering otherwise. The complexity of transforming simple games into compact representations is also examined.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of the inverse semivalue problem for weighted voting games"):
  with members:
    - "degree d chow parameters robustly determine degree d ptfs and algorithmic applications"
    - "algorithmic bayesian persuasion"
    - "public projects boolean functions and the borders of border s theorem"
    - "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "the complexity of power index comparison"

Connected through hyperedge HE-2 (induced by source paper "measuring satisfaction in societies with opinion leaders and mediators"):
  with members:
    - "exponential time complexity of weighted counting of independent sets"

Connected through hyperedge HE-3 (induced by source paper "solving weighted voting game design problems optimally representations synthesis and enumeration"):
  with members:
    - "on the complexity of the decisive problem in simple regular and weighted games"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "the complexity of power index comparison"
    - "the complexity of testing properties of simple games"

Connected through hyperedge HE-4 (induced by source paper "complexity of coalition structure generation"):
  with members:
    - "an anytime algorithm for optimal coalition structure generation"
    - "wiretapping a hidden network"

Connected through hyperedge HE-5 (induced by source paper "spanning connectivity games"):
  with members:
    - "the complexity of power index comparison"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.GT(Computer Science and Game Theory)