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: "false name manipulations in weighted voting games splitting merging and annexation"
  Abstract: An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games which are an important class of coalitional voting games. Weighted voting games have received increased interest in the multiagent community due to their compact representation and ability to model coalitional formation scenarios. Bachrach and Elkind in their AAMAS 2008 paper examined divide and conquer false-name manipulation in weighted voting games from the point of view of Shapley-Shubik index. We analyse the corresponding case of the Banzhaf index and check how much the Banzhaf index of a player increases or decreases if it splits up into sub-players. A pseudo-polynomial algorithm to find the optimal split is also provided. Bachrach and Elkind also mentioned manipulation via merging as an open problem. In the paper, we examine the cases where a player annexes other players or merges with them to increase their Banzhaf index or Shapley-Shubik index payoff. We characterize the computational complexity of such manipulations and provide limits to the manipulation. The annexation non-monotonicity paradox is also discovered in the case of the Banzhaf index. The results give insight into coalition formation and manipulation.

Connected through hyperedge HE-1 (induced by source paper "weighted voting on the blockchain improving consensus in proof of stake protocols"):
  with members:
    - "incentives in ethereum s hybrid casper protocol"
    - "reward sharing schemes for stake pools"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "rethinking blockchain security position paper"
    - "betting on blockchain consensus with fantomette"
    - "consensus in the age of blockchains"
    - "multiplicative weights update with constant step size in congestion games convergence limit cycles and chaos"
    - "casper the friendly finality gadget"

Connected through hyperedge HE-2 (induced by source paper "cooperative product games"):
  with members:
    - "stability scores measuring coalitional stability"

Connected through hyperedge HE-3 (induced by source paper "false name manipulation in weighted voting games is hard for probabilistic polynomial time"):
  with members:
    - "the computational complexity of random serial dictatorship"
    - "false name manipulations in weighted voting games"
    - "the cost of stability in coalitional games"
    - "the computational complexity of probabilistic planning"
    - "the complexity of planar counting problems"

Connected through hyperedge HE-4 (induced by source paper "false name manipulations in weighted voting games"):
  with members:
    - "false name proof mechanisms for hiring a team"
    - "computing the nucleolus of weighted voting games"
    - "computing voting power in easy weighted voting games"

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)