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: "the burden of risk aversion in mean risk selfish routing"
  Abstract: Considering congestion games with uncertain delays, we compute the inefficiency introduced in network routing by risk-averse agents. At equilibrium, agents may select paths that do not minimize the expected latency so as to obtain lower variability. A social planner, who is likely to be more risk neutral than agents because it operates at a longer time-scale, quantifies social cost with the total expected delay along routes. From that perspective, agents may make suboptimal decisions that degrade long-term quality. We define the {\em price of risk aversion} (PRA) as the worst-case ratio of the social cost at a risk-averse Wardrop equilibrium to that where agents are risk-neutral. For networks with general delay functions and a single source-sink pair, we show that the PRA depends linearly on the agents' risk tolerance and on the degree of variability present in the network. In contrast to the {\em price of anarchy}, in general the PRA increases when the network gets larger but it does not depend on the shape of the delay functions. To get this result we rely on a combinatorial proof that employs alternating paths that are reminiscent of those used in max-flow algorithms. For {\em series-parallel} (SP) graphs, the PRA becomes independent of the network topology and its size. As a result of independent interest, we prove that for SP networks with deterministic delays, Wardrop equilibria {\em maximize} the shortest-path objective among all feasible flows.

Connected through hyperedge HE-1 (induced by source paper "on the price of satisficing in network user equilibria"):
  with members:
    - "sensitivity of wardrop equilibria revisited"
    - "how bad is selfish routing in practice"
    - "the impact of worst case deviations in non atomic network routing games"
    - "on the performance of approximate equilibria in congestion games"

Connected through hyperedge HE-2 (induced by source paper "directed graph minors and serial parallel width"):
  with members:
    - "asymptotically tight bounds for inefficiency in risk averse selfish routing"
    - "time inconsistent planning a computational problem in behavioral economics"
    - "a complete anytime algorithm for treewidth"

Connected through hyperedge HE-3 (induced by source paper "uncertainty in multi commodity routing networks when does it help"):
  with members:
    - "how much urban traffic is searching for parking"
    - "effects of information heterogeneity in bayesian routing games"
    - "informational braess paradox the effect of information on traffic congestion"
    - "to observe or not to observe queuing game framework for urban parking"
    - "power control in networks with heterogeneous users a quasi variational inequality approach"
    - "congestion games with distance based strict uncertainty"

Connected through hyperedge HE-4 (induced by source paper "path deviations outperform approximate stability in heterogeneous congestion games"):
  with members:
    - "the impact of worst case deviations in non atomic network routing games"
    - "matroids are immune to braess paradox"
    - "asymptotically tight bounds for inefficiency in risk averse selfish routing"
    - "on the performance of approximate equilibria in congestion games"

Connected through hyperedge HE-5 (induced by source paper "informational braess paradox the effect of information on traffic congestion"):
  with members:
    - "effects of information heterogeneity in bayesian routing games"
    - "matroids are immune to braess paradox"
    - "inducing approximately optimal flow using truthful mediators"
    - "when more information reduces the speed of learning"
    - "groupthink and the failure of information aggregation in large groups"
    - "on the hardness of signaling"
    - "playing the wrong game smoothness bounds for congestion games with behavioral biases"

Connected through hyperedge HE-6 (induced by source paper "the impact of worst case deviations in non atomic network routing games"):
  with members:
    - "path deviations outperform approximate stability in heterogeneous congestion games"
    - "asymptotically tight bounds for inefficiency in risk averse selfish routing"
    - "congestion games with distance based strict uncertainty"
    - "playing the wrong game smoothness bounds for congestion games with behavioral biases"
    - "on the performance of approximate equilibria in congestion games"

Connected through hyperedge HE-7 (induced by source paper "playing the wrong game smoothness bounds for congestion games with behavioral biases"):
  with members:
    - "the price of anarchy in large games"
    - "asymptotically tight bounds for inefficiency in risk averse selfish routing"
    - "congestion games with distance based strict uncertainty"
    - "improving the price of anarchy for selfish routing via coordination mechanisms"
    - "the robust price of anarchy of altruistic games"

Connected through hyperedge HE-8 (induced by source paper "playing the wrong game bounding externalities in diverse populations of agents"):
  with members:
    - "the impact of worst case deviations in non atomic network routing games"
    - "informational braess paradox the effect of information on traffic congestion"
    - "congestion games with distance based strict uncertainty"
    - "the robust price of anarchy of altruistic 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)