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: "complexity of judgment aggregation"
  Abstract: We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the problem of the safety of the agenda). We provide results both for specific aggregation procedures (the quota rules, the premisebased procedure, and a distance-based procedure) and for classes of aggregation procedures characterised in terms of fundamental axioms.

Connected through hyperedge HE-1 (induced by source paper "judgment aggregation in non classical logics"):
  with members:
    - "an abstract algebraic logic view on judgment aggregation"

Connected through hyperedge HE-2 (induced by source paper "complexity results for manipulation bribery and control of the kemeny procedure in judgment aggregation"):
  with members:
    - "models of manipulation on aggregation of binary evaluations"

Connected through hyperedge HE-3 (induced by source paper "a deliberation procedure for judgment aggregation problems"):
  with members:
    - "majority preserving judgment aggregation rules"

Connected through hyperedge HE-4 (induced by source paper "equilibrium refinement through negotiation in binary voting"):
  with members:
    - "endogenous games with goals side payments among goal directed agents"
    - "structure in dichotomous preferences"
    - "a local dominance theory of voting equilibria"
    - "two player preplay negotiation games with conditional offers"
    - "equilibria of plurality voting with abstentions"
    - "beyond nash equilibrium solution concepts for the 21st century"
    - "the strategy proofness landscape of merging"

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