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 "computing bayes nash equilibria in combinatorial auctions with verification"):
  Abstract: We present a new algorithm for computing pure-strategy {\epsilon}-Bayes-Nash equilibria ({\epsilon}-BNEs) in combinatorial auctions. The main innovation of our algorithm is to separate the algorithm's search phase (for finding the {\epsilon}-BNE) from the verification phase (for computing the {\epsilon}). Using this approach, we obtain an algorithm that is both very fast and provides theoretical guarantees on the {\epsilon} it finds. Our main contribution is a verification method which, surprisingly, allows us to upper bound the {\epsilon} across the whole continuous value space without making assumptions about the mechanism. Using our algorithm, we can now compute {\epsilon}-BNEs in multi-minded domains that are significantly more complex than what was previously possible to solve. We release our code under an open-source license to enable researchers to perform algorithmic analyses of auctions, to enable bidders to analyze different strategies, and many other applications.

Includes members:
  Member "estimating approximate incentive compatibility":
    also connected through other hyperedges:
      (none)
  Member "quantifying the strategyproofness of mechanisms via metrics on payoff distributions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms")
  Member "computing best response strategies in infinite games of incomplete information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a generalized training approach for multiagent learning")

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)