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 "infinite duration poorman bidding 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 or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study {\em bidding games} in which the players bid for the right to move the token. Two bidding rules have been defined. In {\em Richman} bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. {\em Poorman} bidding is similar except that the winner of the bidding pays the "bank" rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on {\em infinite-duration} poorman games. A central quantity in these games is the {\em ratio} between the two players' initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such {\em threshold ratios} are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with {\em random-turn based games}. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.

Includes members:
  Member "the efficiency of best response dynamics":
    also connected through other hyperedges:
      (none)
  Member "all pay bidding games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "determinacy in discrete bidding infinite duration games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinite duration bidding games")
  Member "quantitative analysis of smart contracts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "targeted greybox fuzzing with static lookahead analysis")
  Member "infinite duration bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "bidding games and efficient allocations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equilibria in sequential allocation")
  Member "optimizing scrip systems crashes altruists hoarders sybils and collusion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinite duration bidding games")
  Member "sequential auctions of identical items with budget constrained bidders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "limits of efficiency in sequential auctions")

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)