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 "when smoothness is not enough toward exact quantification and optimization of the price of anarchy"):
  Abstract: Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game theory has emerged as a valuable tool to complement more traditional techniques. The fundamental idea behind this approach is the assignment of agents' local cost functions, such that their selfish minimization attains, or is provably close to, the global objective. Any algorithm capable of computing an equilibrium of the corresponding game will inherit an approximation ratio that is, in the worst case, equal to the price-of-anarchy of the considered class of equilibria. Therefore, a successful application of the game design approach hinges on the possibility to quantify and optimize the equilibrium performance. #R##N#Toward this end, we introduce the notion of generalized smoothness, and show that the resulting efficiency bounds are significantly tighter compared to those obtained using the traditional smoothness approach. Leveraging this newly-introduced notion, we quantify the equilibrium performance for the class of local resource allocation games. Finally, we show how the agents' local decision rules can be designed in order to optimize the efficiency of the corresponding equilibria, by means of a tractable linear program.

Includes members:
  Member "optimal price of anarchy in cost sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal mechanisms for distributed resource allocation")
  Member "distributed resource allocation through utility design part i optimizing the performance certificates via the price of anarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal mechanisms for distributed resource allocation")
  Member "utility design for distributed resource allocation part i characterizing and optimizing the exact price of anarchy":
    also connected through other hyperedges:
      (none)
  Member "the impact of local information on the performance of multiagent systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi round cooperative search games with multiple players")
  Member "multiagent maximum coverage problems the trade off between anarchy and stability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal mechanisms for distributed resource allocation")
  Member "learning in games robustness of fast convergence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bandits with adversarial scaling")
  Member "the price of anarchy in auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "bounding the inefficiency of outcomes in generalized second price auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the tractability of public persuasion with no externalities")

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.SY(Systems and Control)