human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the complexity of the inverse semivalue problem for weighted voting games"):
  Abstract: Weighted voting games are a family of cooperative games, typically used to model voting situations where a number of agents (players) vote against or for a proposal. In such games, a proposal is accepted if an appropriately weighted sum of the votes exceeds a prespecified threshold. As the influence of a player over the voting outcome is not in general proportional to her assigned weight, various power indices have been proposed to measure each player's influence. The inverse power index problem is the problem of designing a weighted voting game that achieves a set of target influences according to a predefined power index. In this work, we study the computational complexity of the inverse problem when the power index belongs to the class of semivalues. We prove that the inverse problem is computationally intractable for a broad family of semivalues, including all regular semivalues. As a special case of our general result, we establish computational hardness of the inverse problem for the Banzhaf indices and the Shapley values, arguably the most popular power indices.

Includes members:
  Member "degree d chow parameters robustly determine degree d ptfs and algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "recent advances in algorithmic high dimensional robust statistics")
  Member "algorithmic bayesian persuasion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of contracts")
  Member "public projects boolean functions and the borders of border s theorem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fooling intersections of low weight halfspaces")
  Member "the inverse shapley value problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")
  Member "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nearly tight bounds for robust proper learning of halfspaces with a margin")
  Member "the complexity of power index comparison":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "solving weighted voting game design problems optimally representations synthesis and enumeration")
  Member "complexity of comparison of influence of players in simple games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "measuring satisfaction in societies with opinion leaders and mediators")

Question: Please tell me which class the source paper 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)