About Me

I am a fourth-year Ph.D. student at the University of Illinois, Urbana-Champaign, and part of the Theory Group. I am very fortunate to be advised by Prof. Jugal Garg and Prof. Ruta Mehta. My research interests include algorithmic fair division and game theory.

Previously, I completed my MS in Computer Science from UIUC, during which I was awarded the Siebel Scholarship. Even before, I was an undergrad at IIT Bombay, where I worked with Prof. S. Akshay and received the Institute Academic Prize.

Here is my CV.

Publications

1. Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization.
   

   Neural Information Processing Systems (NeurIPS) (NeurIPS 2023).
   Aniket Murhekar, Bhaskar Chaudhary, Zhuowen Yuan, Bo Li, Ruta Mehta

2. Dynamic Vector Bin Packing for Resource Allocation on the Cloud.
   

   Symposium on Parallelism in Algorithms and Architectures (SPAA 2023).
   Aniket Murhekar, David Arbour, Tung Mai, Anup Rao

3. New Algorithms for the Fair and Efficient Allocation of Indivisible Chores.
   

   International Joint Conference on Artificial Intelligence (IJCAI 2023).
   Jugal Garg, Aniket Murhekar, John Qin

4. Nash Equilibria in Two Player Games Repeated Until Collision.
   

   Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023).
   Aniket Murhekar, Eklavya Sharma

5. (Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna.
   

   International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2022).
   Vasilis Livanos, Ruta Mehta, Aniket Murhekar

6. Tractable Fragments of the Maximum Nash Welfare Problem.
   

   Conference on Web and Internet Economics (WINE 2022).
   Jugal Garg, Edin Husic, Aniket Murhekar, Laszlo Vegh

7. Fair and Efficient Allocations of Bivalued Chores.
   

   AAAI Conference on Artificial Intelligence (AAAI 2022).
   Jugal Garg, Aniket Murhekar, John Qin

8. On Fair and Efficient Allocations of Indivisible Public Goods.
   

   Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021).
   Jugal Garg, Pooja Kulkarni, Aniket Murhekar.

9. Computing Fair and Efficient Allocations with Few Utility Values.
   

   International Symposium on Algorithmic Game Theory (SAGT 2021).
   Jugal Garg, Aniket Murhekar.

10. On Fair and Efficient Allocations of Indivisible Goods.
    

    AAAI Conference on Artificial Intelligence (AAAI 2021).
    Jugal Garg, Aniket Murhekar.

11. Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity.
    

    International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020).
    Aniket Murhekar, Ruta Mehta.

12. Near-optimal complexity bounds for fragments of the Skolem Problem.
    

    Symposium on Theoretical Aspects of Computer Science. (STACS 2020).
    S. Akshay, N. Balaji, A. Murhekar, R. Varma, and N. Vyas.

13. Vocabulary Tailored Summary Generation.
    

    International Conference on Computational Linguistics. (COLING 2018).
    K. Krishna, A. Murhekar, S. Sharma, B. Srinivasan.

14. Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.
    

    Computer Aided Verification. (CAV 2017).
    K. Chatterjee, H. Fu, and A. Murhekar.