Aniket Murhekar

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 27

Top Topics

Nash Equilibria

Additively Separable

Resource Allocation

Top Venues

Publications

Jugal Garg, Aniket Murhekar, John Qin
Fair Division of Indivisible Chores via Earning Restricted Equilibria. CoRR (2024)
Jugal Garg, Aniket Murhekar
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. J. Artif. Intell. Res. 80 (2024)
Jugal Garg, Aniket Murhekar, John Qin
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. CoRR (2024)
Aniket Murhekar, David Arbour, Tung Mai, Anup Rao
Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. CoRR (2023)
Aniket Murhekar, Zhuowen Yuan, Bhaskar Ray Chaudhury, Bo Li, Ruta Mehta
Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization. NeurIPS (2023)
Aniket Murhekar, Eklavya Sharma
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. FSTTCS (2023)
Jugal Garg, Aniket Murhekar
Computing fair and efficient allocations with few utility values. Theor. Comput. Sci. 962 (2023)
Aniket Murhekar, David Arbour, Tung Mai, Anup B. Rao
Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. SPAA (2023)
Jugal Garg, Aniket Murhekar, John Qin
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores. IJCAI (2023)
Aniket Murhekar, Eklavya Sharma
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. CoRR (2023)
Vasilis Livanos, Ruta Mehta, Aniket Murhekar
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. CoRR (2022)
Jugal Garg, Aniket Murhekar, John Qin
Fair and Efficient Allocations of Chores under Bivalued Preferences. AAAI (2022)
Jugal Garg, Aniket Murhekar
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods. CoRR (2022)
Vasilis Livanos, Ruta Mehta, Aniket Murhekar
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna. AAMAS (2022)
Jugal Garg, Aniket Murhekar, John Qin
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores. CoRR (2022)
Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
Tractable Fragments of the Maximum Nash Welfare Problem. WINE (2022)
Jugal Garg, Pooja Kulkarni, Aniket Murhekar
On Fair and Efficient Allocations of Indivisible Public Goods. FSTTCS (2021)
Jugal Garg, Pooja Kulkarni, Aniket Murhekar
On Fair and Efficient Allocations of Indivisible Public Goods. CoRR (2021)
Jugal Garg, Aniket Murhekar
Computing Fair and Efficient Allocations with Few Utility Values. SAGT (2021)
Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR (2021)
Aniket Murhekar, Jugal Garg
On Fair and Efficient Allocations of Indivisible Goods. AAAI (2021)
Jugal Garg, Aniket Murhekar, John Qin
Fair and Efficient Allocations of Chores under Bivalued Preferences. CoRR (2021)
S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS (2020)
Aniket Murhekar, Ruta Mehta
Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity. AAMAS (2020)
Kundan Krishna, Aniket Murhekar, Saumitra Sharma, Balaji Vasan Srinivasan
Vocabulary Tailored Summary Generation. COLING (2018)
Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CoRR (2017)
Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CAV (1) (2017)