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 "determinacy in discrete bidding infinite duration games"):
  Abstract: In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of {\em discrete-bidding} and {\em infinite-duration} games. Our most important result proves that these games form a large determined subclass of concurrent games, where {\em determinacy} is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.

Includes members:
  Member "all pay bidding games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinite duration poorman bidding games")
  Member "concurrent games and semi random determinacy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "games where you can play optimally with finite memory")
  Member "infinite duration poorman bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bidding mechanisms in graph games")
  Member "quantitative analysis of smart contracts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "targeted greybox fuzzing with static lookahead analysis")
  Member "infinite duration bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bidding mechanisms in graph games")
  Member "discrete all pay bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinite duration bidding games")
  Member "first cycle games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "games where you can play optimally with finite memory")
  Member "on subgame perfection in quantitative reachability games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games")

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.GT(Computer Science and Game Theory)