human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "spatial games and global optimization for mobile association problems"
  Abstract: The basic optimal transportation problem consists in findin g the most effective way of moving masses from one location to the other, while minimizing the transportation cost. Such concept has been found to be useful to understand various mathematical, economical, and control theory phenomena, such as Witsenhausen’s counterexample in stochastic control th eory, principal-agent problem in microeconomic theory, location and planning problems, etc. In this work, we focus on mobile association problems: the determination of the cells corresponding to each base station, i.e., the locations at which intelligent mobile terminals prefer to connect to a given base station rather than to others. This work combines game theory and an approach based on optimal transport theory to characterize the solution based on fluid approximations. We characterize the optimal solution from both the global network and the mobile user points of view. I. INTRODUCTION Future wireless networks will be composed by intelligent mobile terminals, capable of accessing multiple radio access technologies, and able to decide for themselves the wireless access technology to use and the access point to which to connect. Within this context, we study the mobile association problem, where we determine the locations at which intelligent mobile terminals prefer to connect to a given base station rather than to others. We consider that these capabilities should be taken into account in the desig n and strategic planning of wireless networks. We analyze the case where mobile terminals within a cell share the same spectrum, and

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