Divyarthi Mohan (she/her)
Tel Aviv University
School of Computer Science
Hi! I am Divyarthi Mohan (I also go by Divya). I am a Postdoctoral Fellow in the Department of Computer Science at Tel Aviv University hosted by Prof. Michal Feldman. During Fall'22, I was a J.P. Morgan Research Fellow at the Simons Institute in Berkeley for the Graph Limits and Processes on Networks program.
I received my PhD in Computer Science from Princeton University, where I was fortunate to be advised by Prof. Matt Weinberg. During my PhD, I had the opportunity to work as a research intern at Microsoft and Google.
My research interest broadly lies at the intersection of Computer Science and Economics. I am primarily interested in Algorithmic Mechanism Design, Social Learning, and Strategic Communication. I am also interested in other areas of Theoretical Computer Science like Approximation Algorithms, Dynamic Algorithms, and Online Algorithms.
Previously, I obtained my MSc in Theoretical Computer Science from The Institute of Mathematical Sciences in Chennai, where I worked with Prof. Sayan Bhattacharya for my Master's thesis. Prior to that, I did my undergraduate studies in Mathematics at Indian Statistical Institute in Bangalore.
Upcoming and Recent News
I am currently on the job market!
I am giving a (virtual) talk at Northwestern University on "Constant Approximation for Private Interdependent Valuations".
I am giving a talk at the Israel AGT day on "Constant Approximations for Auctions with Private Interdependent Valuations".
Presented our paper on Simple Mechanisms for Rich Ad Auctions at NeurIPS 2022 (poster)
Our paper on Interdependent Public Projects was accepted to SODA 2023!
I gave a talk at the Purdue CS Theory Seminar on our paper "Simple Mechanisms for Rich Ad Auctions"
I gave a talk at the INFORMS Annual Meeting on our paper "Communicating with Anecdotes"
I gave a talk at TTIC on "Simplicity and Optimality in Multi-Dimensional Mechanism Design" (papers: 1,2)
I gave a talk at the UIUC CS Theory Seminar on "Simplicity and Optimality in Multi-Dimensional Mechanism Design" (papers: 1,2)
Our paper on Simple Mechanisms for Rich Ad Auctions was accepted to NeurIPS 2022!
Awards & Fellowship
Simons-Berkeley Research Fellowship, Fall 2022
Siebel Scholarship, Class of 2021
School of Engineering and Applied Science Award for Excellence, 2019
Department of Computer Science - Graduate Student Teaching Award, 2018