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 "an economic based analysis of ranking for online bipartite matching"):
  Abstract: We give a simple proof showing that the RANKING algorithm introduced by Karp, Vazirani and Vazirani \cite{DBLP:conf/stoc/KarpVV90} is $1-\frac{1}{e}$ competitive for the online bipartite matching problem. Our proof resembles the proof given by Devanur, Jain and Kleinberg [2013], but does not make an explicit use of linear programming duality; instead, it is based on an economic interpretation of the matching problem. In our interpretation, one set of vertices represent items that are assigned prices, and the other set of vertices represent unit-demand buyers that arrive sequentially and choose their most-demanded items.

Includes members:
  Member "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "combinatorial auctions via posted prices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")

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)