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 "welfare and rationality guarantees for the simultaneous multiple round ascending auction"):
  Abstract: The simultaneous multiple-round auction (SMRA) and the combinatorial clock auction (CCA) are the two primary mechanisms used to sell bandwidth. Under truthful bidding, the SMRA is known to output a Walrasian equilibrium that maximizes social welfare provided the bidder valuation functions satisfy the gross substitutes property. Recently, it was shown that the combinatorial clock auction (CCA) provides good welfare guarantees for general classes of valuation functions. This motivates the question of whether similar welfare guarantees hold for the SMRA in the case of general valuation functions. #R##N#We show the answer is no. But we prove that good welfare guarantees still arise if the degree of complementarities in the bidder valuations are bounded. In particular, if bidder valuations functions are $\alpha$-near-submodular then, under truthful bidding, the SMRA has a welfare ratio (the worst case ratio between the social welfare of the optimal allocation and the auction allocation) of at most $(1+\alpha)$. The special case of submodular valuations, namely $\alpha=1$, and produces individually rational solutions. However, for $\alpha>1$, this is a bicriteria guarantee, to obtain good welfare under truthful bidding requires relaxing individual rationality. #R##N#Finally, we examine what strategies are required to ensure individual rationality in the SMRA with general valuation functions. First, we provide a weak characterization, namely \emph{secure bidding}, for individual rationality. We then show that if the bidders use a profit-maximizing secure bidding strategy the welfare ratio is at most $1+\alpha$. Consequently, by bidding securely, it is possible to obtain the same welfare guarantees as truthful bidding without the loss of individual rationality.

Includes members:
  Member "on the economic efficiency of the combinatorial clock auction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the price of anarchy in auctions")
  Member "the combinatorial world of auctions according to garp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "revealed preference dimension via matrix sign rank")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)