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 "bribery in rating system a game theoretic perspective"):
  Abstract: The rich revenue gained from a mobile application ($a.k.a.$ app) boost app owners (sellers) to manipulate the app store with fake ratings. One effective way to hire fake rating providers is bribery. The fake ratings given by the bribed buyers influence the evaluation of the app, which further have an impact on the decision-making of potential buyers. In this paper, we study bribery in a rating system with multiple sellers and buyers, which extends the single seller situation discussed in \cite{Grandi2016}. We analyze the effect of bribing strategy using game theory methodology and examine the existence of its an equilibrium state, in which the rating system is expected to be bribery-proof: no bribery strategy yields a strictly positive expected gain to the seller. Our study first concentrate on the analysis of static game with a fixed number of sellers and buyers, then we model real-world setting towards a dynamic game. On top of our analysis, we conclude at least one Nash equilibrium can be reached in the bribery game of rating system.

Includes members:
  Member "a network based rating system and its resistance to bribery":
    also connected through other hyperedges:
      (none)
  Member "serf and turf crowdturfing for fun and profit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "text analysis in adversarial settings does deception leave a stylistic trace")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selecting voting locations for fun and profit")

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)