Divyarthi Mohan
Postdoctoral Researcher
Boston University
Computing & Data Sciences




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.

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.

Publications listed below are automatically derived from MEDLINE/PubMed and other sources, which might result in incorrect or missing publications. Faculty can login to make corrections and additions.

iCite Website       Copy PMIDs To Clipboard

  1. Haghtalab N, Immorlica N, Lucier B, Mohan D. Innovations in Theoretical Computer Science (ITCS) 2024. Communicating with Anecdotes. 2024.
  2. Mohan D, Pralat P. International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM) 2024. Asynchronous Majority Dynamics on Binomial Random Graphs. 2024.
  3. Eden A, Feldman M, Mauras S, Mohan D. Conference on Economics and Computation (EC) 2024. Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroid. 2024.
  4. Eden A, Feldman M, Goldner K, Mauras S, Mohan D. Constant Approximation for Private Interdependent Valuations. 2023.
  5. Cohen A, Feldman M, Talgam-Cohen I, Mohan D. Symposium on Discrete Algorithms (SODA) 2023. Interdependent Public Projects. 2023.
  6. Aggarwal G, Bhawalkar K, Mehta A, Psomas A, Mohan D. Advances in Neural Information Processing Systems (NeurIPS) 202201. Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. 2022.
  7. Bahrani M, Immorlica N, Weinberg SM, Mohan D. International Colloquium on Automata, Languages and Programming (ICALP) 2020. Asynchronous Majority Dynamics in Preferential Attachment Trees. 2020.
  8. Kothari P, Schvartzman A, Singla S, Weinberg SM, Mohan D. Symposium on Foundations of Computer Science (FOCS) 2019. Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries. 2020.
  9. Bhattacharya S, Gupta M, Mohan D. European Symposium on Algorithms (ESA) 2017. Improved Algorithm for Dynamic b-Matching. 2017.

This graph shows the total number of publications by year, by first, middle/unknown, or last author.

Bar chart showing 9 publications over 5 distinct years, with a maximum of 3 publications in 2024

YearPublications
20171
20202
20221
20232
20243

Contact for Mentoring:

Same Department