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: "planning with multiple biases"
  Abstract: Recent work has considered theoretical models for the behavior of agents with specific behavioral biases: rather than making decisions that optimize a given payoff function, the agent behaves inefficiently because its decisions suffer from an underlying bias. These approaches have generally considered an agent who experiences a single behavioral bias, studying the effect of this bias on the outcome. #R##N#In general, however, decision-making can and will be affected by multiple biases operating at the same time. How do multiple biases interact to produce the overall outcome? Here we consider decisions in the presence of a pair of biases exhibiting an intuitively natural interaction: present bias -- the tendency to value costs incurred in the present too highly -- and sunk-cost bias -- the tendency to incorporate costs experienced in the past into one's plans for the future. #R##N#We propose a theoretical model for planning with this pair of biases, and we show how certain natural behavioral phenomena can arise in our model only when agents exhibit both biases. As part of our model we differentiate between agents that are aware of their biases (sophisticated) and agents that are unaware of them (naive). Interestingly, we show that the interaction between the two biases is quite complex: in some cases, they mitigate each other's effects while in other cases they might amplify each other. We obtain a number of further results as well, including the fact that the planning problem in our model for an agent experiencing and aware of both biases is computationally hard in general, though tractable under more relaxed assumptions.

Connected through hyperedge HE-1 (induced by source paper "time inconsistent planning simple motivation is hard to find"):
  with members:
    - "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"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-2 (induced by source paper "penalty bidding mechanisms for allocating resources and overcoming present bias"):
  with members:
    - "contingent payment mechanisms for resource utilization"
    - "procrastination with variable present bias"
    - "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-3 (induced by source paper "monopoly pricing with buyer search"):
  with members:
    - "on the value of penalties in time inconsistent planning"
    - "revenue gaps for discriminatory and anonymous sequential posted pricing"
    - "the menu size complexity of revenue approximation"
    - "efficient empirical revenue maximization in single parameter auction environments"
    - "sampling and representation complexity of revenue maximization"
    - "time inconsistent planning a computational problem in behavioral economics"
    - "on the complexity of dynamic mechanism design"
    - "combinatorial auctions via posted prices"

Connected through hyperedge HE-4 (induced by source paper "combinatorial auctions with endowment effect"):
  with members:
    - "the communication complexity of local search"
    - "on the value of penalties in time inconsistent planning"
    - "the price of uncertainty in present biased planning"
    - "motivating time inconsistent agents a computational approach"
    - "procrastination with variable present bias"
    - "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-5 (induced by source paper "dancing pigs or externalities measuring the rationality of security decisions"):
  with members:
    - "procrastination with variable present bias"
    - "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-6 (induced by source paper "the price of uncertainty in present biased planning"):
  with members:
    - "on the value of penalties in time inconsistent planning"
    - "motivating time inconsistent agents a computational approach"
    - "procrastination with variable present bias"
    - "planning problems for sophisticated agents with present bias"
    - "time inconsistent planning a computational problem in behavioral economics"

Connected through hyperedge HE-7 (induced by source paper "motivating time inconsistent agents a computational approach"):
  with members:
    - "on the value of penalties in time inconsistent planning"
    - "the price of uncertainty in present biased planning"
    - "procrastination with variable present bias"
    - "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-8 (induced by source paper "time inconsistent planning a computational problem in behavioral economics"):
  with members:
    - "on the value of penalties in time inconsistent planning"
    - "motivating time inconsistent agents a computational approach"
    - "procrastination with variable present bias"
    - "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)