Divyarthi Mohan (she/her)

Boston University

Faculty of Computing & Data Science

Email    d<lastname>@bu.edu

Hi! I am Divyarthi Mohan (I also go by Divya). I am a Postdoctoral Fellow in the Faculty of Computing and Data Science at Boston University hosted by Prof. Kira Goldner. Previously, I was a Postdoctoral Fellow 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.

Selected Publications

Optimal Stopping with Interdependent Values [paper]

with Simon Mauras, Rebecca Reiffenhäuser.

Conference on Economics and Computation (EC) 2024.

In submission at Mathematics of Operations Research

Constant Approximation for Private Interdependent Valuations [paper]

with Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras.

Symposium on Foundations of Computer Science (FOCS) 2023.

Invited to Highlights Beyond EC 2024.

Communicating with Anecdotes [paper]

with Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius.

Innovations in Theoretical Computer Science (ITCS) 2024.

Talk at the INFORMS Annual Meeting 2022.

Featured in [popular press].

(NBER working paper version: Persuading with Anecdotes)

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries [paper]

with Pravesh Kothari, Ariel Schvartzman, Sahil Singla, S. Matthew Weinberg.

Symposium on Foundations of Computer Science (FOCS) 2019.

Invited paper at Highlights of Algorithms Conference (HALG) 2020.

Awards & Fellowship

Highlights Beyond EC 2024

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

Upcoming and Recent News

I am currently on the job market! 

[Oct 24]

[Sep 24]

[Jul 24]

[Jun 24]

[May 24]

[Dec 23]

[Nov 23]

[Oct 23]

[Aug 23]

[Jul 23]