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: "discrete all pay bidding games"
  Abstract: In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast to the established theory of single-pay bidding games, optimal play involves choosing bids from some probability distribution that will guarantee a minimum probability of winning. In this manner, all-pay bidding games wed the underlying concepts of economic and combinatorial games. We present several results on the structures of optimal strategies in these games. We then give a fast algorithm for computing such strategies for a large class of all-pay bidding games. The methods presented provide a framework for further development of the theory of all-pay bidding games.

Connected through hyperedge HE-1 (induced by source paper "determinacy in discrete bidding infinite duration games"):
  with members:
    - "all pay bidding games on graphs"
    - "concurrent games and semi random determinacy"
    - "infinite duration poorman bidding games"
    - "quantitative analysis of smart contracts"
    - "infinite duration bidding games"
    - "first cycle games"
    - "on subgame perfection in quantitative reachability games"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-2 (induced by source paper "infinite duration bidding games"):
  with members:
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration poorman bidding games"
    - "how much lookahead is needed to win infinite games"
    - "non zero sum games for reactive synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "secure equilibria in weighted games"

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)