Aniket Murhekar

Orcid: 0000-0002-5995-471X

According to our database1, Aniket Murhekar authored at least 21 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods.
J. Artif. Intell. Res., 2024

Fair Division of Indivisible Chores via Earning Restricted Equilibria.
CoRR, 2024

Fair and Efficient Chore Allocation: Existence and Computation.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Weighted EF1 and PO Allocations with Few Types of Agents or Chores.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Fair Federated Learning via the Proportional Veto Core.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Computing fair and efficient allocations with few utility values.
Theor. Comput. Sci., June, 2023

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud.
CoRR, 2023

Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

New Algorithms for the Fair and Efficient Allocation of Indivisible Chores.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Nash Equilibria of Two-Player Matrix Games Repeated Until Collision.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores.
CoRR, 2022

Tractable Fragments of the Maximum Nash Welfare Problem.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Fair and Efficient Allocations of Chores under Bivalued Preferences.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
On Fair and Efficient Allocations of Indivisible Public Goods.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

On Fair and Efficient Allocations of Indivisible Goods.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Approximate Nash Equilibria of Imitation Games: Algorithms and Complexity.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2018
Vocabulary Tailored Summary Generation.
Proceedings of the 27th International Conference on Computational Linguistics, 2018

2017
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017


  Loading...