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 "can taxes improve congestion on all networks"):
  Abstract: We ask if it is possible to positively influence social behavior with no risk of unintentionally incentivizing pathological behavior. In network routing problems, if network traffic is composed of many individual agents, it is known that self-interested behavior among the agents can lead to suboptimal network congestion. We study situations in which a system planner charges monetary tolls for the use of network links in an effort to incentivize efficient routing choices by the users, but in which the users' sensitivity to tolls is heterogeneous and unknown. We seek locally-computed tolls that are guaranteed not to incentivize worse network routing than in the un-influenced case. Our main result is to show that if networks are sufficiently complex and populations sufficiently diverse, perverse incentives cannot be systematically avoided: any taxation mechanism that improves outcomes on one network must necessarily degrade them on another. Nonetheless, for the simple class of parallel networks, non-perverse taxes do exist; we fully characterize all such taxation mechanisms, showing that they are a generalized version of traditional marginal-cost tolls.

Includes members:
  Member "path deviations outperform approximate stability in heterogeneous congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the impact of worst case deviations in non atomic network routing games")
  Member "asymptotically tight bounds for inefficiency in risk averse selfish routing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "directed graph minors and serial parallel width")
  Member "achieving target equilibria in network routing games without knowing the latency functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online constraint satisfaction via tolls in mdp congestion games")
  Member "playing the wrong game smoothness bounds for congestion games with behavioral biases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "routing games in the wild efficiency equilibration and regret large scale field experiments in singapore")
  Member "potential games are necessary to ensure pure nash equilibria in cost sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost sharing games for energy efficient multi hop broadcast in wireless networks")

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)