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: "rational convex programs their feasibility and the arrow debreu nash bargaining game"
  Abstract: Over the last decade, combinatorial algorithms have been obtained for exactly solving several nonlinear convex programs. We first provide a formal context to this activity by introducing the notion of {\em rational convex programs} -- this also enables us to identify a number of questions for further study. So far, such algorithms were obtained for total problems only. Our main contribution is developing the methodology for handling non-total problems, i.e., their associated convex programs may be infeasible for certain settings of the parameters. #R##N#The specific problem we study pertains to a Nash bargaining game, called ADNB, which is derived from the linear case of the Arrow-Debreu market model. We reduce this game to computing an equilibrium in a new market model called {\em flexible budget market}, and we obtain primal-dual algorithms for determining feasibility, as well as giving a proof of infeasibility and finding an equilibrium. We give an application of our combinatorial algorithm for ADNB to an important "fair" throughput allocation problem on a wireless channel.

Connected through hyperedge HE-1 (induced by source paper "non separable quasiconcave utilities are easy in a perfect price discrimination market model"):
  with members:
    - "settling the complexity of arrow debreu equilibria in markets with additively separable utilities"
    - "spending is not easier than trading on the computational equivalence of fisher and arrow debreu equilibria"

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)