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 "how to hire secretaries with stochastic departures"):
  Abstract: We study a generalization of the secretary problem, where decisions do not have to be made immediately upon candidates' arrivals. After arriving, each candidate stays in the system for some (random) amount of time and then leaves, whereupon the algorithm has to decide irrevocably whether to select this candidate or not. The goal is to maximize the probability of selecting the best candidate overall. We assume that the arrival and waiting times are drawn from known distributions. #R##N#Our first main result is a characterization of the optimal policy for this setting. We show that when deciding whether to select a candidate it suffices to know only the time and the number of candidates that have arrived so far. Furthermore, the policy is monotone non-decreasing in the number of candidates seen so far, and, under certain natural conditions, monotone non-increasing in the time. Our second main result is proving that when the number of candidates is large, a single threshold policy is almost optimal.

Includes members:
  Member "online trading as a secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient two sided markets with limited information")
  Member "packing returning secretaries":
    also connected through other hyperedges:
      (none)
  Member "improved approximations for free order prophets and second price auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "assortment auctions a myersonian characterization for markov chain based choice models")
  Member "prophet secretary surpassing the 1 1 e barrier":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "prophet secretary for combinatorial auctions and matroids":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "beyond matroids secretary problem and prophet inequality with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "o log log rank competitive ratio for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "predict and match prophet inequalities with uncertain supply")

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)