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: "regret minimizing equilibria and mechanisms for games with strict type uncertainty"
  Abstract: Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism designer. When this uncertainty is quantified probabilistically, a mechanism induces a game of incomplete information among the agents. However, in many settings, uncertainty over utility functions cannot easily be quantified. We consider the problem of incomplete information games in which type uncertainty is strict or unquantified. We propose the use of minimax regret as a decision criterion in such games, a robust approach for dealing with type uncertainty. We define minimax-regret equilibria and prove that these exist in mixed strategies for finite games. We also consider the problem of mechanism design in this framework by adopting minimax regret as an optimization criterion for the designer itself, and study automated optimization of such mechanisms.

Connected through hyperedge HE-1 (induced by source paper "distance based equilibria in normal form games"):
  with members:
    - "heuristic voting as ordinal dominance strategies"
    - "lipschitz continuity and approximate equilibria"
    - "a local dominance theory of voting equilibria"
    - "congestion games with distance based strict uncertainty"
    - "dominating manipulations in voting with partial information"
    - "the many faces of rationalizability"

Connected through hyperedge HE-2 (induced by source paper "robust and approximately stable marriages under partial information"):
  with members:
    - "stable matching with uncertain linear preferences"

Connected through hyperedge HE-3 (induced by source paper "characterizing solution concepts in terms of common knowledge of rationality"):
  with members:
    - "a logical characterization of iterated admissibility"
    - "characterizing solution concepts in games using knowledge based programs"
    - "lexicographic probability conditional probability and nonstandard probability"

Connected through hyperedge HE-4 (induced by source paper "plurality voting under uncertainty"):
  with members:
    - "a local dominance theory of voting equilibria"
    - "strategic voting and the logic of knowledge"
    - "dominating manipulations in voting with partial information"
    - "distributed computing with adaptive heuristics"

Connected through hyperedge HE-5 (induced by source paper "congestion games with distance based strict uncertainty"):
  with members:
    - "plurality voting under uncertainty"
    - "a local dominance theory of voting equilibria"

Connected through hyperedge HE-6 (induced by source paper "a primer on strategic games"):
  with members:
    - "graphical models for game theory"
    - "conversion preference games"
    - "comparing the notions of optimality in cp nets strategic games and soft constraints"
    - "order independence and rationalizability"
    - "uniform proofs of order independence for various strategy elimination procedures"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-7 (induced by source paper "characterizing solution concepts in games using knowledge based programs"):
  with members:
    - "extensive games with possibly unaware players"
    - "using counterfactuals in knowledge based programming"
    - "great expectations part i on the customizability of generalized expected utility"

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