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 "informational braess paradox the effect of information on traffic congestion"):
  Abstract: To systematically study the implications of additional information about routes provided to certain users (e.g., via GPS-based route guidance systems), we introduce a new class of congestion games in which users have differing information sets about the available edges and can only use routes consisting of edges in their information set. After defining the notion of Information Constrained Wardrop Equilibrium (ICWE) for this class of congestion games and studying its basic properties, we turn to our main focus: whether additional information can be harmful (in the sense of generating greater equilibrium costs/delays). We formulate this question in the form of Informational Braes' Paradox (IBP), which extends the classic Braess' Paradox in traffic equilibria, and asks whether users receiving additional information can become worse off. We provide a comprehensive answer to this question showing that in any network in the series of linearly independent (SLI) class, which is a strict subset of series-parallel networks, IBP cannot occur, and in any network that is not in the SLI class, there exists a configuration of edge-specific cost functions for which IBP will occur. In the process, we establish several properties of the SLI class of networks, which include the characterization of the complement of the SLI class in terms of embedding a specific set of networks, and also an algorithm which determines whether a graph is SLI in linear time. We further prove that the worst-case inefficiency performance of ICWE is no worse than the standard Wardrop equilibrium.

Includes members:
  Member "effects of information heterogeneity in bayesian routing games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal dynamic information provision in traffic routing")
  Member "matroids are immune to braess paradox":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "negative prices in network pricing games")
  Member "inducing approximately optimal flow using truthful mediators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "differentially private call auctions and market impact")
  Member "the burden of risk aversion in mean risk selfish routing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the price of satisficing in network user equilibria")
  Member "when more information reduces the speed of learning":
    also connected through other hyperedges:
      (none)
  Member "groupthink and the failure of information aggregation in large groups":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "teaching and learning in uncertainty")
  Member "on the hardness of signaling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of contracts")
  Member "playing the wrong game smoothness bounds for congestion games with behavioral biases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "can taxes improve congestion on all 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)