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 "pacing equilibrium in first price auction markets"):
  Abstract: In ad auctions--the prevalent monetization mechanism of Internet companies--advertisers compete for online impressions in a sequential auction market. Since advertisers are typically budget-constrained, a common tool employed to improve their ROI is that of pacing, i.e., uniform scaling of their bids to preserve their budget for a longer duration. If the advertisers are excessively paced, they end up not spending their budget, while if they are not sufficiently paced, they use up their budget too soon. Therefore, it is important that they are paced at just the right amount, a solution concept that we call a pacing equilibrium. In this paper, we study pacing equilibria in the context of first-price auctions, which are popular in the theory of ad mechanisms. We show existence, uniqueness, and efficient computability of first-price pacing equilibria (FPPE), while also establishing several other salient features of this solution concept. In the process, we uncover a sharp contrast between these solutions and second price pacing equilibria (SPPE), the latter being known to produce non-unique, fragile solutions that are also computationally hard to obtain. Simulations show that FPPE have better revenue properties than SPPE, that bidders have lower ex-post regret, and that incentives to misreport budgets for thick markets are smaller.

Includes members:
  Member "computing large market equilibria using abstractions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "increasing iterate averaging for solving saddle point problems")
  Member "fair division without disparate impact":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust market equilibria with uncertain preferences")
  Member "multiplicative pacing equilibria in auction markets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stability and learning in strategic queuing systems")
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "on revenue maximization in second price ad auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "selective call out and real time bidding")
  Member "budget optimization in search based advertising auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "personalized attraction enhanced sponsored search with multi task 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)