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 "selfish network creation with non uniform edge cost"):
  Abstract: Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges are treated uniformly, i.e. every edge has the same cost and that this common parameter heavily influences the outcomes and the analysis of these games. #R##N#We propose and analyze simple and natural parameter-free network creation games with non-uniform edge cost. Our models are inspired by social networks where the cost of forming a link is proportional to the popularity of the targeted node. Besides results on the complexity of computing a best response and on various properties of the sequential versions, we show that the most general version of our model has constant Price of Anarchy. To the best of our knowledge, this is the first proof of a constant Price of Anarchy for any network creation game.

Includes members:
  Member "locality based network creation games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometric network creation games")
  Member "network creation games think global act local":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "geometric network creation games")
  Member "quality of service in network creation games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "geometric network creation games")
  Member "network formation games with heterogeneous players and the internet structure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometric network creation games")
  Member "tree nash equilibria in the network creation game":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometric network creation games")
  Member "on dynamics in selfish network creation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the efficiency of best response dynamics")
  Member "greedy selfish network creation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "geometric network creation games")

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)