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: "pricing online decisions beyond auctions"
  Abstract: We consider dynamic pricing schemes in online settings where selfish agents generate online events. Previous work on online mechanisms has dealt almost entirely with the goal of maximizing social welfare or revenue in an auction settings. This paper deals with quite general settings and minimizing social costs. We show that appropriately computed posted prices allow one to achieve essentially the same performance as the best online algorithm. This holds in a wide variety of settings. Unlike online algorithms that learn about the event, and then make enforceable decisions, prices are posted without knowing the future events or even the current event, and are thus inherently dominant strategy incentive compatible. #R##N#In particular we show that one can give efficient posted price mechanisms for metrical task systems, some instances of the $k$-server problem, and metrical matching problems. We give both deterministic and randomized algorithms. Such posted price mechanisms decrease the social cost dramatically over selfish behavior where no decision incurs a charge. One alluring application of this is reducing the social cost of free parking exponentially.

Connected through hyperedge HE-1 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets"):
  with members:
    - "a general framework for endowment effects in combinatorial markets"
    - "combinatorial auctions with endowment effect"
    - "max min greedy matching"
    - "pricing for online resource allocation intervals and paths"
    - "pricing multi unit markets"
    - "makespan minimization via posted prices"
    - "price doubling and item halving robust revenue guarantees for item pricing"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"

Connected through hyperedge HE-2 (induced by source paper "prophet inequality for bipartite matching merits of being simple and non adaptive"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"
    - "maximizing efficiency in dynamic matching markets"
    - "makespan minimization via posted prices"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "online contention resolution schemes"

Connected through hyperedge HE-3 (induced by source paper "secretary ranking with minimal inversions"):
  with members:
    - "active ranking from pairwise comparisons and when parametric assumptions don t help"
    - "top k ranking from pairwise comparisons when spectral ranking is optimal"
    - "parallel algorithms for select and partition with noisy comparisons"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "secretary problems with non uniform arrival order"
    - "spectral mle top k rank aggregation from pairwise comparisons"
    - "simple robust and optimal ranking from pairwise comparisons"
    - "on the k independence required by linear probing and minwise independence"

Connected through hyperedge HE-4 (induced by source paper "prompt scheduling for selfish agents"):
  with members:
    - "makespan minimization via posted prices"

Connected through hyperedge HE-5 (induced by source paper "flow equilibria via online surge pricing"):
  with members:
    - "spatio temporal pricing for ridesharing platforms"

Connected through hyperedge HE-6 (induced by source paper "pricing multi unit markets"):
  with members:
    - "a simple and approximately optimal mechanism for a buyer with complements"
    - "the invisible hand of dynamic market pricing"
    - "a simple and approximately optimal mechanism for an additive buyer"
    - "revenue maximization for selling multiple correlated items"
    - "combinatorial auctions via posted prices"
    - "simultaneous auctions are almost efficient"
    - "dynamic pricing with limited supply"
    - "non price equilibria in markets of discrete goods"

Connected through hyperedge HE-7 (induced by source paper "simple pricing schemes for the cloud"):
  with members:
    - "pricing multi unit markets"
    - "pricing identical items"
    - "revenue gaps for discriminatory and anonymous sequential posted pricing"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "revenue gaps for static and dynamic posted pricing of homogeneous goods"
    - "hiring secretaries over time the benefit of concurrent employment"
    - "on demand or spot selling the cloud to risk averse customers"
    - "truthful online scheduling with commitments"

Connected through hyperedge HE-8 (induced by source paper "makespan minimization via posted prices"):
  with members:
    - "the invisible hand of dynamic market pricing"
    - "tight bounds for online vector scheduling"
    - "combinatorial auctions via posted prices"
    - "combinatorial walrasian equilibrium"
    - "the power of randomness in bayesian optimal mechanism design"
    - "algorithmic pricing via virtual valuations"

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)