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: "combinatorial auctions with decreasing marginal utilities"
  Abstract: Abstract   In most of microeconomic theory, consumers are assumed to exhibit decreasing marginal utilities. This paper considers combinatorial auctions among such submodular buyers. The valuations of such buyers are placed within a hierarchy of valuations that exhibit no complementarities, a hierarchy that includes also OR and XOR combinations of singleton valuations, and valuations satisfying the gross substitutes property. Those last valuations are shown to form a zero-measure subset of the submodular valuations that have positive measure. While we show that the allocation problem among submodular valuations is NP-hard, we present an efficient greedy 2-approximation algorithm for this case and generalize it to the case of limited complementarities. No such approximation algorithm exists in a setting allowing for arbitrary complementarities. Some results about strategic aspects of combinatorial auctions among players with decreasing marginal utilities are also presented.

Connected through hyperedge HE-1 (induced by source paper "complexity theory game theory and economics the barbados lectures"):
  with members:
    - "a round collapse theorem for computationally sound protocols or tfnp is hard on average in pessiland"
    - "on communication complexity of fixed point computation"
    - "near optimal communication lower bounds for approximate nash equilibria"
    - "query to communication lifting for bpp"
    - "lifting randomized query complexity to randomized communication complexity"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "communication complexity of approximate nash equilibria"
    - "the price of anarchy in auctions"

Connected through hyperedge HE-2 (induced by source paper "fair and truthful mechanisms for dichotomous valuations"):
  with members:
    - "maximum nash welfare and other stories about efx"
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "fair division of indivisible goods among strategic agents"
    - "competitive equilibrium with generic budgets beyond additive"
    - "a little charity guarantees almost envy freeness"
    - "the price of fairness for indivisible goods"
    - "fair division with bounded sharing"
    - "truthful allocation mechanisms without payments characterization and implications on fairness"

Connected through hyperedge HE-3 (induced by source paper "approximate mathbb f _2 sketching of valuation functions"):
  with members:
    - "optimality of linear sketching under modular updates"
    - "optimal lower bounds for universal relation and for samplers and finding duplicates in streams"
    - "testing submodularity and other properties of valuation functions"
    - "almost optimal streaming algorithms for coverage problems"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "towards tight bounds for the streaming set cover problem"
    - "streaming algorithms for submodular function maximization"
    - "incidence geometries and the pass complexity of semi streaming set cover"

Connected through hyperedge HE-4 (induced by source paper "budget feasible mechanism design for non monotone submodular objectives offline and online"):
  with members:
    - "a nearly linear time algorithm for submodular maximization with a knapsack constraint"
    - "on budget feasible mechanism design for symmetric submodular objectives"
    - "simple and efficient budget feasible mechanisms for monotone submodular valuations"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "budget feasible mechanisms on matroids"
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "coverage matching and beyond new results on budgeted mechanism design"
    - "submodular secretary problems cardinality matching and linear constraints"

Connected through hyperedge HE-5 (induced by source paper "optimal approximation for unconstrained non submodular minimization"):
  with members:
    - "near optimal approximate discrete and continuous submodular function minimization"
    - "fast maximization of non submodular monotonic functions on the integer lattice"
    - "on maximization of weakly modular functions guarantees of multi stage algorithms tractability and hardness"
    - "gradient methods for submodular maximization"
    - "guarantees for greedy maximization of non submodular functions with applications"
    - "submodular optimization under noise"
    - "subquadratic submodular function minimization"
    - "tolerant junta testing and the connection to submodular optimization and function isomorphism"

Connected through hyperedge HE-6 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders"):
  with members:
    - "complement free couples must communicate a hardness result for two player combinatorial auctions"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "prophet secretary for combinatorial auctions and matroids"
    - "on simultaneous two player combinatorial auctions"
    - "combinatorial auctions do need modest interaction"
    - "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders"
    - "computational efficiency requires simple taxation"
    - "online matroid intersection beating half for random arrival"

Connected through hyperedge HE-7 (induced by source paper "regression under human assistance"):
  with members:
    - "adaptive hard thresholding for near optimal consistent robust regression"
    - "selectivenet a deep neural network with an integrated reject option"
    - "the algorithmic automation problem prediction triage and human effort"
    - "submodular maximization beyond non negativity guarantees fast algorithms and applications"
    - "direct uncertainty prediction for medical second opinions"
    - "non submodular function maximization subject to a matroid constraint with applications"
    - "bias reduced uncertainty estimation for deep neural classifiers"
    - "active regression via linear sample sparsification"

Connected through hyperedge HE-8 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"):
  with members:
    - "understanding the correlation gap for matchings"
    - "submodular maximization through the lens of linear programming"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization beyond 1 e"
    - "online contention resolution schemes"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "a stochastic probing problem with applications"
    - "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"

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)