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 "gibbard satterthwaite games for k approval voting rules"):
  Abstract: The Gibbard-Satterthwaite theorem implies the existence of voters, called manipulators, who can change the election outcome in their favour by voting strategically. When a given preference profile admits several such manipulators, voting becomes a game played by these voters, who have to reason strategically about each others' actions. To complicate the game even further, counter-manipulators may then try to counteract the actions of manipulators. Our voters are boundedly rational and do not think beyond manipulating or countermanipulating. We call these games Gibbard--Satterthwaite Games. In this paper we look for conditions that guarantee the existence of a Nash equilibria in pure strategies.

Includes members:
  Member "equilibria of plurality voting lazy and truth biased voters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "persuading voters it s easy to whisper it s hard to speak loud")
  Member "is it ever safe to vote strategically":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strategic voting under uncertainty about the voting method")
  Member "a classification of weakly acyclic games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coordination games on weighted directed graphs")
  Member "equilibria of plurality voting with abstentions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sybil resilient social choice with partial participation")

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)