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 "distance rationalization of anonymous and homogeneous voting rules"):
  Abstract: The concept of distance rationalizability of voting rules has been explored in recent years by several authors. Roughly speaking, we first choose a consensus set of elections (defined via preferences of voters over candidates) for which the result is specified a priori (intuitively, these are elections on which all voters can easily agree on the result). We also choose a measure of distance between elections. The result of an election outside the consensus set is defined to be the result of the closest consensual election under the distance measure. #R##N#Most previous work has dealt with a definition in terms of preference profiles. However, most voting rules in common use are anonymous and homogeneous. In this case there is a much more succinct representation (using the voting simplex) of the inputs to the rule. This representation has been widely used in the voting literature, but rarely in the context of distance rationalizability. #R##N#We show exactly how to connect distance rationalizability on profiles for anonymous and homogeneous rules to geometry in the simplex. We develop the connection for the important special case of votewise distances, recently introduced and studied by Elkind, Faliszewski and Slinko in several papers. This yields a direct interpretation in terms of well-developed mathematical concepts not seen before in the voting literature, namely Kantorovich (also called Wasserstein) distances and the geometry of Minkowski spaces. #R##N#As an application of this approach, we prove some positive and some negative results about the decisiveness of distance rationalizable anonymous and homogeneous rules. The positive results connect with the recent theory of hyperplane rules, while the negative ones deal with distances that are not metrics, controversial notions of consensus, and the fact that the $\ell^1$-norm is not strictly convex.

Includes members:
  Member "distance rationalization of social rules":
    also connected through other hyperedges:
      (none)
  Member "a smooth transition from powerlessness to absolute power":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how private is your voting a framework for comparing the privacy of voting mechanisms")
  Member "rationalizations of condorcet consistent rules via distances of hamming type":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "are there any nicely structured preference profiles nearby")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)