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: "the impossibility of extending random dictatorship to weak preferences"
  Abstract: Random dictatorship has been characterized as the only social decision scheme that satisfies efficiency and strategyproofness when individual preferences are strict. We show that no extension of random dictatorship to weak preferences satisfies these properties, even when significantly weakening the required degree of strategyproofness.

Connected through hyperedge HE-1 (induced by source paper "participatory budgeting models and approaches"):
  with members:
    - "truthful aggregation of budget proposals"
    - "markets for public decision making"
    - "fair allocation of indivisible public goods"
    - "proportionally representative participatory budgeting axioms and algorithms"
    - "fair mixing the case of dichotomous preferences"
    - "iterative local voting for collective decision making in continuous spaces"
    - "the core of the participatory budgeting problem"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-2 (induced by source paper "keeping your friends close land allocation with friends"):
  with members:
    - "graphical one sided markets"
    - "efficiency of truthful and symmetric mechanisms in one sided matching"
    - "complexity results for rainbow matchings"
    - "social welfare in one sided matchings random priority and beyond"
    - "peer effects and stability in matching markets"

Connected through hyperedge HE-3 (induced by source paper "proving the incompatibility of efficiency and strategyproofness via smt solving"):
  with members:
    - "optimal bounds for the no show paradox via sat solving"
    - "the computational complexity of random serial dictatorship"
    - "automated search for impossibility theorems in social choice theory ranking sets of objects"

Connected through hyperedge HE-4 (induced by source paper "incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences"):
  with members:
    - "random assignment with multi unit demands"
    - "an axiomatic approach to characterizing and relaxing strategyproofness of one sided matching mechanisms"
    - "the computational complexity of random serial dictatorship"

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)