| Multi-armed bandits with bounded arm-memory: Near-optimal guarantees for best-arm identification and regret minimization A Maiti, V Patil, A Khan Advances in Neural Information Processing Systems 34, 19553-19565, 2021 | 19* | 2021 |
| On guillotine separable packings for the two-dimensional geometric knapsack problem A Khan, A Maiti, A Sharma, A Wiese SOCG 2021, 2021 | 18 | 2021 |
| Universal and tight online algorithms for generalized-mean welfare S Barman, A Khan, A Maiti Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 4793-4800, 2022 | 13 | 2022 |
| Fairness and welfare quantification for regret in multi-armed bandits S Barman, A Khan, A Maiti, A Sawarni Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6762-6769, 2023 | 11 | 2023 |
| On parameterized complexity of binary networked public goods game A Maiti, P Dey Algorithmica, 2023, 2020 | 11* | 2020 |
| On parameterized complexity of liquid democracy P Dey, A Maiti, A Sharma Conference on Algorithms and Discrete Applied Mathematics, 83-94, 2021 | 8 | 2021 |
| Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing A Khan, A Lonkar, A Maiti, A Sharma, A Wiese ICALP 2022, 2022 | 5 | 2022 |
| Instance-dependent sample complexity bounds for zero-sum matrix games A Maiti, K Jamieson, L Ratliff International Conference on Artificial Intelligence and Statistics, 9429-9469, 2023 | 2 | 2023 |
| Parameterized Algorithms for Kidney Exchange A Maiti, P Dey IJCAI 2022, 2021 | 2 | 2021 |
| On binary networked public goods game with altruism A Maiti, P Dey Latin American Symposium on Theoretical Informatics, 289-303, 2024 | 1 | 2024 |
| Logarithmic regret for matrix games against an adversary with noisy bandit feedback A Maiti, K Jamieson, LJ Ratliff arXiv preprint arXiv:2306.13233, 2023 | 1 | 2023 |
| Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits A Maiti, R Boczar, K Jamieson, L Ratliff International Conference on Artificial Intelligence and Statistics, 2602-2610, 2024 | | 2024 |
| Query complexity of tournament solutions A Maiti, P Dey Theoretical Computer Science 991, 114422, 2024 | | 2024 |
| Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game A Maiti, R Boczar, K Jamieson, LJ Ratliff arXiv preprint arXiv:2310.16236, 2023 | | 2023 |
Arindam KhanAssociate Professor, Indian Institute of Science, Bengaluru在 iisc.ac.in 的电子邮件经过验证
