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 "playing the wrong game bounding externalities in diverse populations of agents"):
  Abstract: The robustness of multiagent systems can be affected by mistakes or behavioral biases (e.g., risk-aversion, altruism, toll-sensitivity), with some agents playing the "wrong game." This can change the set of equilibria, and may in turn harm or improve the social welfare of agents in the system. We are interested in bounding what we call the biased price of anarchy (BPoA) in populations with diverse agent behaviors, which is the ratio between welfare in the "wrong" equilibrium and optimal welfare. #R##N#We study nonatomic routing games, and derive an externality bound that depends on a key topological parameter of the underlying network. #R##N#We then prove two general BPoA bounds for games with diverse populations: one that relies on the network structure and the average bias of all agents in the population, and one that is independent of the structure but depends on the maximal bias. Both types of bounds can be combined with known results to derive concrete BPoA bounds for a variety of specific behaviors (e.g., varied levels of risk-aversion).

Includes members:
  Member "the impact of worst case deviations in non atomic network routing games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the price of satisficing in network user equilibria")
  Member "informational braess paradox the effect of information on traffic congestion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "signaling in bayesian network congestion games the subtle power of symmetry")
  Member "the burden of risk aversion in mean risk selfish routing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the price of satisficing in network user equilibria")
  Member "congestion games with distance based strict uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distance based equilibria in normal form games")
  Member "the robust price of anarchy of altruistic games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prior independent equilibria and linear multi dimensional bayesian 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)