human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "multi cap optimization for wireless data plans with time flexibility"):
  Abstract: An effective way for a Mobile network operator (MNO) to improve its revenue is price discrimination, i.e., providing different combinations of data caps and subscription fees. Rollover data plan (allowing the unused data in the current month to be used in the next month) is an innovative data mechanism with time flexibility. In this paper, we study the MNO's optimal multi-cap data plans with time flexibility in a realistic asymmetric information scenario. Specifically, users are associated with multi-dimensional private information, and the MNO designs a contract (with different data caps and subscription fees) to induce users to truthfully reveal their private information. This problem is quite challenging due to the multi-dimensional private information. We address the challenge in two aspects. First, we find that a feasible contract (satisfying incentive compatibility and individual rationality) should allocate the data caps according to users' willingness-to-pay (captured by the slopes of users' indifference curves). Second, for the non-convex data cap allocation problem, we propose a Dynamic Quota Allocation Algorithm, which has a low complexity and guarantees the global optimality. Numerical results show that the time-flexible data mechanisms increase both the MNO's profit (25% on average) and users' payoffs (8.2% on average) under price discrimination.

Includes members:
  Member "duopoly competition for mobile data plans with time flexibility":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a novel mobile data contract design with time flexibility")
  Member "economic viability of data trading with rollover":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "duopoly competition for mobile data plans with time flexibility")
  Member "a novel mobile data contract design with time flexibility":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "duopoly competition for mobile data plans with time flexibility")
  Member "exploring time flexibility in wireless data plans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "duopoly competition for mobile data plans with time flexibility")
  Member "on optimal two sided pricing of congested networks":
    also connected through other hyperedges:
      (none)
  Member "economic analysis of crowdsourced wireless community networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond the vcg mechanism truthful reverse auctions for relay selection with high data rates high base station utility and low interference in d2d networks")
  Member "an integrated spectrum and information market for green cognitive communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "duopoly competition for mobile data plans with time flexibility")
  Member "the role of data cap in optimal two part network pricing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "duopoly competition for mobile data plans with time flexibility")

Question: Please tell me which class the source paper 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)