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 "multi category fairness in sponsored search auctions"):
  Abstract: Fairness in advertising is a topic of particular concern motivated by theoretical and empirical observations in both the computer science and economics literature. We examine the problem of fairness in advertising for general purpose platforms that service advertisers from many different categories. First, we propose inter-category and intra-category fairness desiderata that take inspiration from individual fairness and envy-freeness. Second, we investigate the "platform utility" (a proxy for the quality of the allocation) achievable by mechanisms satisfying these desiderata. More specifically, we compare the utility of fair mechanisms against the unfair optimal, and we show by construction that our fairness desiderata are compatible with utility. That is, we construct a family of fair mechanisms with high utility that perform close to optimally within a class of fair mechanisms. Our mechanisms also enjoy nice implementation properties including metric-obliviousness, which allows the platform to produce fair allocations without needing to know the specifics of the fairness requirements.

Includes members:
  Member "discrimination through optimization how facebook s ad delivery can lead to biased outcomes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pots protective optimization technologies")
  Member "toward controlling discrimination in online ad auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interventions for ranking in the presence of implicit bias")
  Member "balanced news using constrained bandit based personalization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for search recommendation and online advertising a survey by xiangyu zhao long xia jiliang tang and dawei yin with martin vesely as coordinator")
  Member "a new system wide diversity measure for recommendations with efficient algorithms":
    also connected through other hyperedges:
      (none)
  Member "fairness under composition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithmic fairness")
  Member "ranking with fairness constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fair correlation clustering")
  Member "fairness through awareness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithmic fairness")

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)