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: "hiring expert consultants in e healthcare an analytics based two sided matching approach"
  Abstract: Very often in some censorious healthcare scenario, there may be a need to have some expert consultancies (especially by doctors) that are not available in-house to the hospitals. Earlier, this interesting healthcare scenario of hiring the expert consultants (mainly doctors) from outside of the hospitals had been studied with the robust concepts of mechanism design with money and mechanism design without money. In this paper, we explore the more realistic two sided matching market in our healthcare set-up. In this, the members of the two participating communities, namely the patients and the doctors are revealing the strict preference ordering over the members of the opposite community for a stipulated amount of time. We assume that the patients and doctors are strategic in nature. With the theoretical analysis, we demonstrate that the TOMHECs, that results in the stable allocation of doctors to the patients, satisfies the several economic properties such as strategy-proof-ness (or truthfulness) and optimality. Further, the analytically based analysis of our proposed mechanisms i.e. RAMHECs and TOMHECs are carried out on the ground of the expected distance of the allocation done by the mechanisms from the top most preference. The proposed mechanisms are also validated with the help of exhaustive experiments.

Connected through hyperedge HE-1 (induced by source paper "a budget feasible mechanism for hiring doctors in e healthcare"):
  with members:
    - "budget feasible mechanisms"

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)