Divyarthi Mohan

Orcid: 0000-0002-8671-5714

According to our database1, Divyarthi Mohan authored at least 14 papers between 2017 and 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
1
1
1
4
2
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mechanism Design via the Interim Relaxation.
CoRR, 2024

Optimal Stopping with Interdependent Values.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Communicating with Anecdotes (Extended Abstract).
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Asynchronous Majority Dynamics on Binomial Random Graphs.
Proceedings of the Approximation, 2024

2023
Interdependent Public Projects.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Constant Approximation for Private Interdependent Valuations.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Communicating with Anecdotes.
CoRR, 2022

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Simplicity and Optimality in Algorithmic Economics: Multi-Item Auctions and Social Learning
PhD thesis, 2021

2020
Asynchronous Majority Dynamics in Preferential Attachment Trees.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Approximation Schemes for a Buyer with Independent Items via Symmetries.
CoRR, 2019

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
Improved Algorithm for Dynamic b-Matching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017


  Loading...