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: "a truthful in expectation mechanism for the generalized assignment problem"
  Abstract: We propose a truthful-in-expectation, $(1-\frac{1}{e})$-approximation mechanism for the generalized assignment auction. In such an auction, each bidder has a knapsack valuation function and bidders' values for items are private. We present a novel convex optimization program for the auction which results in a maximal-in-distributional-range (MIDR) allocation rule. The presented program contains at least a $(1-\frac{1}{e})$ ratio of the optimal social welfare. We show how to implement the convex program in polynomial time using a fractional local search algorithm which approximates the optimal solution within an arbitrarily small error. This leads to an approximately MIDR allocation rule which in turn can be transformed to an approximately truthful-in-expectation mechanism. Our contribution has algorithmic importance, as well; it simplifies the existing optimization algorithms for the GAP while the approximation ratio is comparable to the best given approximation.

Connected through hyperedge HE-1 (induced by source paper "a note on relaxation and rounding in algorithmic mechanism design"):
  with members:
    - "generalized assignment problem truthful mechanism design without money"
    - "from convex optimization to randomized mechanisms toward optimal combinatorial auctions"
    - "truthful assignment without money"
    - "truthfulness via proxies"
    - "on the power of randomization in algorithmic mechanism design"

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)