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 "efficient multi resource multi unit vcg auction"):
  Abstract: We consider the optimization problem of a multi-resource, multi-unit VCG auction that produces an optimal, i.e., non-approximated, social welfare. We present an algorithm that solves this optimization problem with pseudo-polynomial complexity and demonstrate its efficiency via our implementation. Our implementation is efficient enough to be deployed in real systems to allocate computing resources in fine time-granularity. Our algorithm has a pseudo-near-linear time complexity on average (over all possible realistic inputs) with respect to the number of clients and the number of possible unit allocations. In the worst case, it is quadratic with respect to the number of possible allocations. Our experiments validate our analysis and show near-linear complexity. This is in contrast to the unbounded, nonpolynomial complexity of known solutions, which do not scale well for a large number of agents. #R##N#For a single resource and concave valuations, our algorithm reproduces the results of a well-known algorithm. It does so, however, without subjecting the valuations to any restrictions and supports a multiple resource auction, which improves the social welfare over a combination of single-resource auctions by a factor of 2.5-50. This makes our algorithm applicable to real clients in a real system.

Includes members:
  Member "non monetary fair scheduling a cooperative game theory approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "well behaved online load balancing against strategic jobs")
  Member "optimal multi dimensional mechanism design reducing revenue to welfare maximization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "fair allocation without trade":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the cluster admission problem for cloud computing")
  Member "no justified complaints on fair sharing of multiple resources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the cluster admission problem for cloud computing")
  Member "computationally feasible vcg mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "machine learning powered iterative combinatorial auctions")
  Member "optimal solutions for multi unit combinatorial auctions branch and bound heuristics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to search via retrospective imitation")

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)