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: "bilinear games polynomial time algorithms for rank based subclasses"
  Abstract: Motivated by the sequence form formulation of Koller et al. (GEB'96), this paper defines {\em bilinear games}, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games with compact polytopal strategy sets and two payoff matrices (A,B) such that when (x,y) is the played strategy profile, the payoffs of the players are xAy and xBy respectively. We show that bilinear games are very general and capture many interesting classes of games like bimatrix games, two player Bayesian games, polymatrix games, two-player extensive form games with perfect recall etc. as special cases, and hence are hard to solve in general. #R##N#Existence of a (symmetric) Nash equilibrium for (symmetric) bilinear games follow directly from the known results. For a given bilinear game, we define its {\em Best Response Polytopes} (BRPs) and characterize the set of Nash equilibria as {\em fully-labeled} pairs in the BRPs. We consider a rank based hierarchy of bilinear games, where rank of a game (A,B) is defined as rank(A+B). In this paper, we give polynomial time algorithms to compute Nash equilibrium for special classes of bilinear games: #R##N#(i) Rank-1 games (i.e., rank(A+B)=1). (ii) FPTAS for constant rank games (i.e., rank(A+B) is constant). (iii) When rank(A) or rank(B) is constant. This improves the results by Lipton et al. (EC'03) and Kannan et al. (ET'09), for bimatrix games with low rank matrices.

Connected through hyperedge HE-1 (induced by source paper "computing stackelberg equilibria of large general sum games"):
  with members:
    - "a polynomial time algorithm for spatio temporal security games"
    - "security game with non additive utilities and multiple attacker resources"
    - "oracle efficient online learning and auction design"
    - "the mysteries of security games equilibrium computation becomes combinatorial algorithm design"
    - "faster and simpler algorithm for optimal strategies of blotto game"
    - "catcher evader games"

Connected through hyperedge HE-2 (induced by source paper "nash equilibrium in smoothed polynomial time for network coordination games"):
  with members:
    - "near optimal communication lower bounds for approximate nash equilibria"
    - "local max cut in smoothed polynomial time"
    - "an empirical study on computing equilibria in polymatrix games"
    - "communication complexity of approximate nash equilibria"
    - "inapproximability of nash equilibrium"
    - "constant rank bimatrix games are ppad hard"
    - "query complexity of approximate nash equilibria"
    - "an experimental analysis of lemke howson algorithm"

Connected through hyperedge HE-3 (induced by source paper "from duels to battefields computing equilibria of blotto and other games"):
  with members:
    - "faster and simpler algorithm for optimal strategies of blotto game"
    - "price of competition and dueling games"
    - "the matching polytope has exponential extension complexity"
    - "polynomial time computation of exact correlated equilibrium in compact games"
    - "computing nash equilibria approximation and smoothed complexity"

Connected through hyperedge HE-4 (induced by source paper "the mysteries of security games equilibrium computation becomes combinatorial algorithm design"):
  with members:
    - "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-5 (induced by source paper "constant rank bimatrix games are ppad hard"):
  with members:
    - "settling some open problems on 2 player symmetric nash equilibria"
    - "a direct reduction of ppad lemke verified linear complementarity problems to bimatrix games"
    - "on oblivious ptas s for nash equilibrium"
    - "the complexity of the homotopy method equilibrium selection and lemke howson solutions"
    - "settling the complexity of arrow debreu equilibria in markets with additively separable utilities"
    - "reducibility among fractional stability problems"
    - "settling the complexity of computing two player nash equilibria"
    - "games of fixed rank a hierarchy of bimatrix games"

Connected through hyperedge HE-6 (induced by source paper "the complexity of nash equilibria as revealed by data"):
  with members:
    - "constant rank bimatrix games are ppad hard"
    - "computational rationalization the inverse equilibrium problem"
    - "the empirical implications of rank in bimatrix games"
    - "efficiently learning from revealed preference"
    - "settling the complexity of arrow debreu equilibria in markets with additively separable utilities"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-7 (induced by source paper "on the existence of low rank explanations for mixed strategy behavior"):
  with members:
    - "settling the complexity of arrow debreu equilibria in markets with additively separable utilities"
    - "settling the complexity of computing two player nash 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)