Süleyman Kerimov defended his dissertation yesterday, in Stanford's MS&E department. He studies matching, and will teach at Rice next year.
His main advisors are both named Itai.
These are the papers he spoke about:
- Dynamic Matching: Characterizing and Achieving Constant Regret, with Itai Ashlagi and Itai Gurvich, . [pdf] [SSRN]
- Scrip Systems with Minimal Availability, with Itai Ashlagi, working paper.
- Appeared as an extended abstract in the 15th Conference on Web and Internet Economics (WINE 2019).
Mazel tov and tebrikler, Suleyman.
Welcome to the club.
No comments:
Post a Comment