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 "distributed task management in cyber physical systems how to cooperate under uncertainty"):
  Abstract: We consider the problem of task allocation in a network of cyber-physical systems (CPSs). The network can have different states, and the tasks are of different types. The task arrival is stochastic and state-dependent. Every CPS is capable of performing each type of task with some specific state-dependent efficiency. The CPSs have to agree on task allocation prior to knowing about the realized network's state and/or the arrived tasks. We model the problem as a multi-state stochastic cooperative game with state uncertainty. We then use the concept of deterministic equivalence and sequential core to solve the problem. We establish the non-emptiness of the strong sequential core in our designed task allocation game and investigate its characteristics including uniqueness and optimality. Moreover, we prove that in the task allocation game, the strong sequential core is equivalent to Walrasian equilibrium under state uncertainty; consequently, it can be implemented by using the Walras' tatonnement process.

Includes members:
  Member "distributed user association in energy harvesting small cell networks an exchange economy with uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient resource allocation in machine to machine communications with multiple access and energy harvesting for iot")
  Member "distributed user association in energy harvesting small cell networks a probabilistic bandit model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient optimization of wireless powered 5g full duplex cellular networks a mean field game approach")
  Member "minority games with applications to distributed decision making and control in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computation offloading and activation of mobile edge computing servers a minority game")
  Member "distributed channel assignment in cognitive radio networks stable matching and walrasian equilibrium":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed learning for channel allocation over a shared spectrum")
  Member "secondary spectrum auctions for markets with communication constraints":
    also connected through other hyperedges:
      (none)
  Member "stackelberg contention games in multiuser networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "near optimal deviation proof medium access control designs in wireless networks")

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)