human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "incentive design for ridesharing with uncertainty"
  Abstract: We consider a ridesharing problem where there is uncertainty about the completion of trips from both drivers and riders. Specifically, we study ridesharing mechanisms that aim to incentivize commuters to reveal their valuation for trips and their probability of undertaking their trips. Due to the interdependence created by the uncertainty on commuters' valuations, we show that the Groves mechanisms are not ex-post truthful even if there is only one commuter whose valuation depends on the other commuters' uncertainty of undertaking their trips. To circumvent this impossibility, we propose an ex-post truthful mechanism, the best incentive we can design without sacrificing social welfare in this setting. Our mechanism pays a commuter if she undertakes her trip, otherwise she is penalized for not undertaking her trip. Furthermore, we identify a sufficient and necessary condition under which our mechanism is ex-post truthful.

Connected through hyperedge HE-1 (induced by source paper "an online mechanism for ridesharing in autonomous mobility on demand systems"):
  with members:
    - "the social dilemma of autonomous vehicles"
    - "managing autonomous mobility on demand systems for better passenger experience"
    - "an anytime algorithm for optimal coalition structure generation"
    - "anytime heuristic search"

Connected through hyperedge HE-2 (induced by source paper "the costs and benefits of ridesharing sequential individual rationality and sequential fairness"):
  with members:
    - "fast detour computation for ride sharing"

Question: Please tell me which class the center node 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)