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 "an axiomatization of the shapley shubik index for interval decisions"):
  Abstract: The Shapley-Shubik index was designed to evaluate the power distribution in committee systems drawing binary decisions and is one of the most established power indices. It was generalized to decisions with more than two levels of approval in the input and output. In the limit we have a continuum of options. For these games with interval decisions we prove an axiomatization of a power measure and show that the Shapley-Shubik index for simple games, as well as for $(j,k)$ simple games, occurs as a special discretization. This relation and the closeness of the stated axiomatization to the classical case suggests to speak of the Shapley-Shubik index for games with interval decisions, that can also be generalized to a value.

Includes members:
  Member "importance in systems with interval decisions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "axiomatizations for the shapley shubik power index for games with several levels of approval in the input and output")
  Member "the roll call interpretation of the shapley value":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "axiomatizations for the shapley shubik power index for games with several levels of approval in the input and output")
  Member "measuring voting power in convex policy spaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "axiomatizations for the shapley shubik power index for games with several levels of approval in the input and output")

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)