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: "inner product spaces for minsum coordination mechanisms"
  Abstract: We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling. To obtain the approximation bounds, we introduce a new technique that while conceptually simple, seems to be quite powerful. With this method we are able to prove the following results. #R##N#First, we consider Smith's Rule, which orders the jobs on a machine in ascending processing time to weight ratio, and show that it achieves an approximation ratio of 4. We also demonstrate that this is the best possible for deterministic non-preemptive strongly local policies. Since Smith's Rule is always optimal for a given assignment, this may seem unsurprising, but we then show that better approximation ratios can be obtained if either preemption or randomization is allowed. #R##N#We prove that ProportionalSharing, a preemptive strongly local policy, achieves an approximation ratio of 2.618 for the weighted sum of completion times, and an approximation ratio of 2.5 in the unweighted case. Again, we observe that these bounds are tight. Next, we consider Rand, a natural non-preemptive but randomized policy. We show that it achieves an approximation ratio of at most 2.13; moreover, if the sum of the weighted completion times is negligible compared to the cost of the optimal solution, this improves to \pi /2. #R##N#Finally, we show that both ProportionalSharing and Rand induce potential games, and thus always have a pure Nash equilibrium (unlike Smith's Rule). This also allows us to design the first \emph{combinatorial} constant-factor approximation algorithm minimizing weighted completion time for unrelated machine scheduling that achieves a factor of 2+ \epsilon for any \epsilon > 0.

Connected through hyperedge HE-1 (induced by source paper "approximating generalized network design under dis economies of scale with applications to energy efficiency"):
  with members:
    - "online primal dual for non linear optimization with applications to speed scaling"

Connected through hyperedge HE-2 (induced by source paper "stochastic online scheduling on unrelated machines"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "lift and round to improve weighted completion time on unrelated machines"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"

Connected through hyperedge HE-3 (induced by source paper "designing networks with good equilibria under uncertainty"):
  with members:
    - "online network design algorithms via hierarchical decompositions"
    - "potential games are necessary to ensure pure nash equilibria in cost sharing games"
    - "improving the price of anarchy for selfish routing via coordination mechanisms"
    - "efficient coordination mechanisms for unrelated machine scheduling"
    - "an o lognloglogn upper bound on the price of stability for undirected shapley network design games"

Connected through hyperedge HE-4 (induced by source paper "bounding the inefficiency of altruism through social contribution games"):
  with members:
    - "bayesian games and the smoothness framework"
    - "composable and efficient mechanisms"
    - "the robust price of anarchy of altruistic games"
    - "altruism in atomic congestion games"

Connected through hyperedge HE-5 (induced by source paper "improving the price of anarchy for selfish routing via coordination mechanisms"):
  with members:
    - "efficient coordination mechanisms for unrelated machine scheduling"

Connected through hyperedge HE-6 (induced by source paper "smooth inequalities and equilibrium inefficiency in scheduling games"):
  with members:
    - "efficient coordination mechanisms for unrelated machine scheduling"

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)