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 "minimal envy and popular matchings"):
  Abstract: We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable envy towards agents who received most preferred objects -- minimal envy matching. A matching is fair from social perspective if it is supported by majority against any other matching -- popular matching. Surprisingly, the two perspectives give the same outcome: when a popular matching exists it is equivalent to a minimal envy matching. #R##N#We show the equivalence between global and local popularity: a matching is popular if and only if there does not exist a group of size up to 3 agents that decides to exchange their objects by majority, keeping the remaining matching fixed. We algorithmically show that an arbitrary matching is path-connected to a popular matching where along the path groups of up to 3 agents exchange their objects by majority. A market where random groups exchange objects by majority converges to a popular matching given such matching exists. #R##N#When popular matching might not exist we define most popular matching as a matching that is popular among the largest subset of agents. We show that each minimal envy matching is a most popular matching and propose a polynomial-time algorithm to find them.

Includes members:
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "popular matchings with two sided preferences and one sided ties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding popular matchings via stable matchings")
  Member "counting popular matchings in house allocation problems":
    also connected through other hyperedges:
      (none)
  Member "weighted popular matchings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unpopularity factor in the marriage and roommates problems")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incomplete preferences in single peaked electorates")

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.GT(Computer Science and Game Theory)