Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. - Krishnendu Chatterjee; Hongfei Fu 001; Aniket Murhekar (CAV (1), 2017)

Vocabulary Tailored Summary Generation. - Kundan Krishna; Aniket Murhekar; Saumitra Sharma; Balaji Vasan Srinivasan (COLING, 2018)

Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity. - Aniket Murhekar; Ruta Mehta (AAMAS, 2020)

Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. - S. Akshay 001; Nikhil Balaji; Aniket Murhekar; Rohith Varma; Nikhil Vyas 001 (STACS, 2020)

On Fair and Efficient Allocations of Indivisible Goods. - Aniket Murhekar; Jugal Garg (AAAI, 2021)

On Fair and Efficient Allocations of Indivisible Public Goods. - Jugal Garg; Pooja Kulkarni; Aniket Murhekar (FSTTCS, 2021)

Fair and Efficient Allocations of Chores under Bivalued Preferences. - Jugal Garg; Aniket Murhekar; John Qin (AAAI, 2022)

(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. - Vasilis Livanos; Ruta Mehta; Aniket Murhekar (AAMAS, 2022)

Tractable Fragments of the Maximum Nash Welfare Problem. - Jugal Garg; Edin Husic; Aniket Murhekar; László A. Végh (WINE, 2022)

Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. - Jugal Garg; Aniket Murhekar; John Qin (CoRR, 2022)

Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. - Aniket Murhekar; Eklavya Sharma (FSTTCS, 2023)

New Algorithms for the Fair and Efficient Allocation of Indivisible Chores. - Jugal Garg; Aniket Murhekar; John Qin (IJCAI, 2023)

Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization. - Aniket Murhekar; Zhuowen Yuan; Bhaskar Ray Chaudhury; Bo Li 026; Ruta Mehta (NeurIPS, 2023)

Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. - Aniket Murhekar; David Arbour; Tung Mai; Anup B. Rao (SPAA, 2023)

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. - Aniket Murhekar; David Arbour; Tung Mai; Anup Rao 002 (CoRR, 2023)

Computing fair and efficient allocations with few utility values. - Jugal Garg; Aniket Murhekar (Theor. Comput. Sci., 2023)

Fair Federated Learning via the Proportional Veto Core. - Bhaskar Ray Chaudhury; Aniket Murhekar; Zhuowen Yuan; Bo Li 026; Ruta Mehta; Ariel D. Procaccia (ICML, 2024)

Weighted EF1 and PO Allocations with Few Types of Agents or Chores. - Jugal Garg; Aniket Murhekar; John Qin (IJCAI, 2024)

Fair and Efficient Chore Allocation: Existence and Computation. - Aniket Murhekar (IJCAI, 2024)

Fair Division of Indivisible Chores via Earning Restricted Equilibria. - Jugal Garg; Aniket Murhekar; John Qin (CoRR, 2024)

Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. - Jugal Garg; Aniket Murhekar (J. Artif. Intell. Res., 2024)

On the Theoretical Foundations of Data Exchange Economies. - Hannaneh Akrami; Bhaskar Ray Chaudhury; Jugal Garg; Aniket Murhekar (EC, 2025)

Non-preemptive Throughput Maximization under Time-varying Capacity. - Aniket Murhekar; Manish Purohit; Zoya Svitkina; Erik Vee; Joshua R. Wang (SPAA, 2025)

Constant-Factor EFX Exists for Chores. - Jugal Garg; Aniket Murhekar; John Qin (STOC, 2025)

Existence of 2-EFX Allocations of Chores. - Jugal Garg; Aniket Murhekar (CoRR, 2025)