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 "route cost assignment with joint user and operator behavior as a many to one stable matching assignment game"):
  Abstract: We propose a generalized market equilibrium model using assignment game criteria for evaluating transportation systems that consist of both operators and users: fixed route transit, multimodal systems, and Mobility-as-a-Service in general. The model finds stable pricing and matches between users in a network with a set of routes with line capacities. The proposed model gives a set of stable outcomes instead of single point pricing that allows operators to design their ticket pricing based on a desired mechanism or policy (as opposed to other matching studies that focus on operating a specific mechanism design). We look at three different examples to test our model. As a case study we evaluate taxi ridesharing in NYC. Based on the taxi data and study area in Lower Manhattan, the model justifies a market share of 71.8% of users that would take shared rides. Sharing taxi results in a 31.4% decrease in travel mileage. The model suggests that adopting a policy that can require passengers to walk up to 1 block away to meet with a shared taxi would require the operating cost savings to exceed the $0.44/traveler by another $0.13 if they do not wish to turn away any of these passengers.

Includes members:
  Member "fair cost allocation for ridesharing services modeling mathematical programming and an algorithm to find the nucleolus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a path based many to many assignment game to model mobility as a service market networks")
  Member "network learning via multiagent inverse transportation problems":
    also connected through other hyperedges:
      (none)
  Member "a decomposition algorithm to solve the multi hop peer to peer ride matching problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a distributed model free algorithm for multi hop ride sharing using deep reinforcement learning")
  Member "the costs and benefits of ridesharing sequential individual rationality and sequential fairness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a distributed model free algorithm for multi hop ride sharing using deep reinforcement learning")
  Member "a stackelberg strategy for routing flow over time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computation of dynamic equilibria in series parallel networks")

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.CE(Computational Engineering, Finance, and Science)