Fast and Secure Oblivious Stable Matching over Arithmetic Circuits

ePrint Report: Fast and Secure Oblivious Stable Matching over Arithmetic Circuits

Arup Mondal, Priyam Panda, Shivam Agarwal, Abdelrahaman Aly, Debayan Gupta

The classic stable matching algorithm of Gale and Shapley (American Mathematical Monthly '69) and subsequent variants such as those by Roth (Mathematics of Operations Research '82) and Abdulkadiroglu et al. (American Economic Review '05) have been used successfully in a number of real-world scenarios, including the assignment of medical-school graduates to residency programs, New York City teenagers to high …

algorithm american eprint report fast mathematics oblivious operations panda report research