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 "polyhedral clinching auctions and the adwords polytope"):
  Abstract: A central issue in applying auction theory in practice is the problem of dealing with budget-constrained agents. A desirable goal in practice is to design incentive compatible, individually rational, and Pareto optimal auctions while respecting the budget constraints. Achieving this goal is particularly challenging in the presence of nontrivial combinatorial constraints over the set of feasible allocations. #R##N#Toward this goal and motivated by AdWords auctions, we present an auction for {\em polymatroidal} environments satisfying the above properties. Our auction employs a novel clinching technique with a clean geometric description and only needs an oracle access to the submodular function defining the polymatroid. As a result, this auction not only simplifies and generalizes all previous results, it applies to several new applications including AdWords Auctions, bandwidth markets, and video on demand. In particular, our characterization of the AdWords auction as polymatroidal constraints might be of independent interest. This allows us to design the first mechanism for Ad Auctions taking into account simultaneously budgets, multiple keywords and multiple slots. #R##N#We show that it is impossible to extend this result to generic polyhedral constraints. This also implies an impossibility result for multi-unit auctions with decreasing marginal utilities in the presence of budget constraints.

Includes members:
  Member "clinching auctions beyond hard budget constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polyhedral clinching auctions for two sided markets")
  Member "efficiency guarantees in auctions with budgets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an end to end argument in mechanism design prior independent auctions for budgeted agents")
  Member "optimal multi dimensional mechanism design reducing revenue to welfare maximization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "clinching auctions with online supply":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polyhedral clinching auctions for two sided markets")
  Member "prior free auctions for budgeted agents":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a simple mechanism for a budget constrained buyer")
  Member "on multiple round sponsored search auctions with budgets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "clinching auctions with online supply")
  Member "bayesian mechanism design for budget constrained agents":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a simple mechanism for a budget constrained buyer")
  Member "no justified complaints on fair sharing of multiple resources":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient multi resource multi unit vcg auction")

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)