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 we reach pareto optimal outcomes using bottom up approaches"):
  Abstract: Traditionally, researchers in decision making have focused on attempting to reach Pareto Optimality using horizontal approaches, where optimality is calculated taking into account every participant at the same time. Sometimes, this may prove to be a difficult task (e.g., conflict, mistrust, no information sharing, etc.). In this paper, we explore the possibility of achieving Pareto Optimal outcomes in a group by using a bottom-up approach: discovering Pareto optimal outcomes by interacting in subgroups. We analytically show that Pareto optimal outcomes in a subgroup are also Pareto optimal in a supergroup of those agents in the case of strict, transitive, and complete preferences. Then, we empirically analyze the prospective usability and practicality of bottom-up approaches in a variety of decision making domains.

Includes members:
  Member "unanimously acceptable agreements for negotiation teams in unpredictable domains":
    also connected through other hyperedges:
      (none)
  Member "tasks for agent based negotiation teams analysis review and challenges":
    also connected through other hyperedges:
      (none)
  Member "studying the impact of negotiation environments on negotiation teams performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intra team strategies for teams negotiating against competitor matchers and conceders")
  Member "evolutionary aided negotiation model for bilateral bargaining in ambient intelligence domains with complex utility functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strategies for utility maximization in social groups with preferential exploration")
  Member "achieving fully proportional representation is easy in practice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "empirical evaluation of real world tournaments")
  Member "reaching unanimous agreements within agent based negotiation teams with linear and monotonic utility functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unanimously acceptable agreements for negotiation teams in unpredictable domains")
  Member "techniques for highly multiobjective optimisation some nondominated points are better than others":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "locating the boundaries of pareto fronts a many objective evolutionary algorithm based on corner solution search")

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.MA(Multiagent Systems)