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 "two body assignment problem in the context of the israeli medical internship match"):
  Abstract: This thesis was submitted as partial fulfillment of the requirements for the Masters Degree in the Department of Computer Science, Bar-Ilan University. #R##N#The final step in getting an Israeli M.D. is performing a year-long internship in one of the hospitals in Israel. Internships are decided upon by a lottery, which is known as "The Internship Lottery". In 2014 we redesigned the lottery, replacing it with a more efficient one. The new method is based on calculating a tentative lottery, in which each student has some probability of getting to each hospital. Then a computer program "trades" between the students, where trade is performed only if it is beneficial to both sides. This trade creates surplus, which translates to more students getting one of their top choices. The average student improved his place by $0.91$ seats. The new method can improve the welfare of medical graduates, by giving them more probability to get to one of their top choices. It can be applied in internship markets in other countries as well. #R##N#This thesis presents the market, the redesign process and the new mechanism which is now in use. There are two main lessons that we have learned from this market. The first is the "Do No Harm" principle, which states that (almost) all participants should prefer the new mechanism to the old one. The second is that new approaches need to be used when dealing with two-body problems in object assignment. We focus on the second lesson, and study two-body problems in the context of the assignment problem. We show that decomposing stochastic assignment matrices to deterministic allocations is NP-hard in the presence of couples, and present a polynomial time algorithm with the optimal worst case guarantee. We also study the performance of our algorithm on real-world and on simulated data.

Includes members:
  Member "fair and square cake cutting in two dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dividing a graphical cake")
  Member "sorting and selection with imprecise comparisons":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally private hypothesis selection")
  Member "an approximate law of one price in random assignment games":
    also connected through other hyperedges:
      (none)
  Member "the and or game equilibrium characterization working paper":
    also connected through other hyperedges:
      (none)
  Member "non price equilibria in markets of discrete goods":
    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)