| Fair and efficient allocations of chores under bivalued preferences J Garg, A Murhekar, J Qin Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5043-5050, 2022 | 38 | 2022 |
| Computing fair and efficient allocations with few utility values J Garg, A Murhekar Theoretical Computer Science 962, 113932, 2023 | 33 | 2023 |
| Automated recurrence analysis for almost-linear expected-runtime bounds K Chatterjee, H Fu, A Murhekar International Conference on Computer Aided Verification, 118-139, 2017 | 31 | 2017 |
| Generating a targeted summary of textual content tuned to a target audience vocabulary S Sharma, K Krishna, BV Srinivasan, A Murhekar US Patent 10,409,898, 2019 | 30 | 2019 |
| Generating a targeted summary of textual content tuned to a target audience vocabulary S Sharma, K Krishna, BV Srinivasan, A Murhekar US Patent 10,534,854, 2020 | 23 | 2020 |
| On fair and efficient allocations of indivisible goods A Murhekar, J Garg Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5595-5602, 2021 | 20 | 2021 |
| Tractable fragments of the maximum nash welfare problem J Garg, E Husić, A Murhekar, L Végh arXiv preprint arXiv:2112.10199, 2021 | 13 | 2021 |
| On fair and efficient allocations of indivisible public goods J Garg, P Kulkarni, A Murhekar arXiv preprint arXiv:2107.09871, 2021 | 10 | 2021 |
| Near-optimal complexity bounds for fragments of the Skolem problem S Akshay, N Balaji, A Murhekar, R Varma, N Vyas 37th International Symposium on Theoretical Aspects of Computer Science …, 2020 | 9 | 2020 |
| Improving fairness and efficiency guarantees for allocating indivisible chores J Garg, A Murhekar, J Qin arXiv preprint arXiv:2212.02440, 2022 | 8 | 2022 |
| Approximate nash equilibria of imitation games: Algorithms and complexity A Murhekar, R Mehta AAMAS Conference proceedings, 2020 | 6 | 2020 |
| New algorithms for the fair and efficient allocation of indivisible chores J Garg, A Murhekar, J Qin arXiv preprint arXiv:2212.02440, 2022 | 5 | 2022 |
| Computing pareto-optimal and almost envy-free allocations of indivisible goods J Garg, A Murhekar arXiv preprint arXiv:2204.14229, 2022 | 5 | 2022 |
| Vocabulary tailored summary generation K Krishna, A Murhekar, S Sharma, BV Srinivasan Proceedings of the 27th International Conference on Computational …, 2018 | 5 | 2018 |
| (Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna V Livanos, R Mehta, A Murhekar arXiv preprint arXiv:2202.02672, 2022 | 3 | 2022 |
| Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud A Murhekar, D Arbour, T Mai, A Rao arXiv preprint arXiv:2304.08648, 2023 | 2 | 2023 |
| Incentives in federated learning: Equilibria, dynamics, and mechanisms for welfare maximization A Murhekar, Z Yuan, B Ray Chaudhury, B Li, R Mehta Advances in Neural Information Processing Systems 36, 2024 | 1 | 2024 |
| Brief announcement: Dynamic vector bin packing for online resource allocation in the cloud A Murhekar, D Arbour, T Mai, AB Rao Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 1 | 2023 |
| Weighted EF1 and PO Allocations with Few Types of Agents or Chores J Garg, A Murhekar, J Qin arXiv preprint arXiv:2402.17173, 2024 | | 2024 |
| Nash Equilibria of Two-Player Matrix Games Repeated Until Collision A Murhekar, E Sharma arXiv preprint arXiv:2309.15870, 2023 | | 2023 |
Jugal GargAssistant Professor, University of Illinois at Urbana-ChampaignVerified email at illinois.edu
