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.
Upcoming and Recent News
I am currently on the job market!
I am visiting SLMath (MSRI), Berkeley this Fall as a research member in the Market and Mechanism Design program.
Our paper on Constant Approximation for Private Interdependent Valuations was accepted to FOCS 2023!
I'll be giving a spotlight talk at the GIW at EC on "Constant Approximation for Private Interdependent Valuations", and will also be at the EC poster sessions.
I gave a talk at the HUJI EconCS Seminar on "Constant Approximation for Private Interdependent Valuations".
I gave a (virtual) talk at Northwestern University on "Constant Approximation for Private Interdependent Valuations".
I gave a talk at the Israel AGT day on "Constant Approximations for Auctions with Private Interdependent Valuations".
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"
Our paper on Simple Mechanisms for Rich Ad Auctions was accepted to NeurIPS 2022!