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 advert assignment"):
  Abstract: We develop a framework for the analysis of large-scale Ad-auctions where adverts are assigned over a continuum of search types. For this pay-per-click market, we provide an efficient and highly decomposed mechanism that maximizes social welfare. In particular, we show that the social welfare optimization can be solved in separate optimizations conducted on the time-scales relevant to the advertisement platform and advertisers. Here, on each search occurrence, the platform solves an assignment problem and, on a slower time scale, each advertiser submits a bid which matches its demand for click-throughs with supply. Importantly knowledge of global parameters, such as the distribution of search terms, is not required when separating the problem in this way. This decomposition is implemented in an adversarial setting. Exploiting the information asymmetry between the platform and advertiser, we describe a simple mechanism which incentivizes truthful bidding and has a unique Nash equilibrium that is socially optimal, and thus implements our decomposition. Further, we consider models where advertisers adapt their bids smoothly over time, and prove convergence to the solution that maximizes aggregate utility. Finally, we describe several extensions which illustrate the flexibility and tractability of our framework.

Includes members:
  Member "econometrics for learning agents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust multi agent counterfactual prediction")
  Member "optimising trade offs among stakeholders in ad auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a price per attention auction scheme using mouse cursor information")
  Member "a dynamic axiomatic approach to first price auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sponsored search auctions with rich ads")
  Member "bayesian sequential auctions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online submodular welfare maximization greedy beats 1 2 in random order")
  Member "simplicity expressiveness tradeoffs in mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interpolating between truthful and non truthful mechanisms for combinatorial auctions")
  Member "online advertisement optimization and stochastic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "throughput optimal routing in blockchain based payment systems")
  Member "truthful mechanisms with implicit payment computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incentivizing exploration with selective data disclosure")
  Member "bidding to the top vcg and equilibria of position based auctions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algorithmic methods for sponsored search advertising")

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)