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 "favorite candidate voting for eliminating the least popular candidate in metric spaces"):
  Abstract: We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the voters' preferences over candidates. In the voting, each voter is asked to submit her favorite candidate. Given the collection of favorite candidates, a mechanism for eliminating the least popular candidate finds a committee containing all candidates but the one to be eliminated. Each committee is associated with a social value that is the sum of the costs (utilities) it imposes (provides) to the voters. We design mechanisms for finding a committee to optimize the social value. We measure the quality of a mechanism by its distortion, defined as the worst-case ratio between the social value of the committee found by the mechanism and the optimal one. We establish new upper and lower bounds on the distortion of mechanisms in this single-candidate voting, for both general metrics and well-motivated special cases.

Includes members:
  Member "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "committee scoring rules axiomatic characterization and hierarchy")
  Member "improved metric distortion for deterministic social choice rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries")
  Member "awareness of voter passion greatly improves the distortion of metric social choice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries")
  Member "ordinal approximation for social choice matching and facility location problems given candidate positions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries")
  Member "metric distortion of social choice rules lower bounds and fairness properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries")
  Member "randomized social choice functions under metric preferences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how good is a two party election game")
  Member "on voting and facility location":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selecting voting locations for fun and profit")

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)