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: "procrastination with variable present bias"
  Abstract: Individuals working towards a goal often exhibit time inconsistent behavior, making plans and then failing to follow through. One well-known model of such behavioral anomalies is present-bias discounting: individuals over-weight present costs by a bias factor. This model explains many time-inconsistent behaviors, but can make stark predictions in many settings: individuals either follow the most efficient plan for reaching their goal or procrastinate indefinitely. #R##N#We propose a modification in which the present-bias parameter can vary over time, drawn independently each step from a fixed distribution. Following Kleinberg and Oren (2014), we use a weighted task graph to model task planning, and measure the cost of procrastination as the relative expected cost of the chosen path versus the optimal path. We use a novel connection to optimal pricing theory to describe the structure of the worst-case task graph for any present-bias distribution. We then leverage this structure to derive conditions on the bias distribution under which the worst-case ratio is exponential (in time) or constant. We also examine conditions on the task graph that lead to improved procrastination ratios: graphs with a uniformly bounded distance to the goal, and graphs in which the distance to the goal monotonically decreases on any path.

Connected through hyperedge HE-1 (induced by source paper "penalty bidding mechanisms for allocating resources and overcoming present bias"):
  with members:
    - "planning with multiple biases"
    - "contingent payment mechanisms for resource utilization"
    - "planning problems for sophisticated agents with present bias"
    - "contingent payment mechanisms to maximize resource utilization"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-2 (induced by source paper "combinatorial auctions with endowment effect"):
  with members:
    - "the communication complexity of local search"
    - "planning with multiple biases"
    - "on the value of penalties in time inconsistent planning"
    - "the price of uncertainty in present biased planning"
    - "motivating time inconsistent agents a computational approach"
    - "planning problems for sophisticated agents with present bias"
    - "computational issues in time inconsistent planning"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-3 (induced by source paper "dancing pigs or externalities measuring the rationality of security decisions"):
  with members:
    - "planning with multiple biases"
    - "planning problems for sophisticated agents with present bias"
    - "your browsing behavior for a big mac economics of personal information online"
    - "near rationality and competitive equilibria in networked systems"

Connected through hyperedge HE-4 (induced by source paper "the price of uncertainty in present biased planning"):
  with members:
    - "planning with multiple biases"
    - "on the value of penalties in time inconsistent planning"
    - "motivating time inconsistent agents a computational approach"
    - "planning problems for sophisticated agents with present bias"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-5 (induced by source paper "planning with multiple biases"):
  with members:
    - "motivating time inconsistent agents a computational approach"
    - "planning problems for sophisticated agents with present bias"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-6 (induced by source paper "motivating time inconsistent agents a computational approach"):
  with members:
    - "planning with multiple biases"
    - "on the value of penalties in time inconsistent planning"
    - "the price of uncertainty in present biased planning"
    - "planning problems for sophisticated agents with present bias"
    - "computational issues in time inconsistent planning"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-7 (induced by source paper "time inconsistent planning a computational problem in behavioral economics"):
  with members:
    - "planning with multiple biases"
    - "on the value of penalties in time inconsistent planning"
    - "motivating time inconsistent agents a computational approach"
    - "planning problems for sophisticated agents with present bias"
    - "computational issues in time inconsistent planning"

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)