Streaming Algorithms for Stochastic Multi-armed Bandits. - Arnab Maiti; Vishakha Patil; Arindam Khan 001 (CoRR, 2020)

On Parameterized Complexity of Liquid Democracy. - Palash Dey; Arnab Maiti; Amatya Sharma (CALDAM, 2021)

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. - Arindam Khan 001; Arnab Maiti; Amatya Sharma; Andreas Wiese (SoCG, 2021)

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. - Arnab Maiti; Vishakha Patil; Arindam Khan 001 (NeurIPS, 2021)

Universal and Tight Online Algorithms for Generalized-Mean Welfare. - Siddharth Barman; Arindam Khan 001; Arnab Maiti (AAAI, 2022)

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ICALP, 2022)

Parameterized Algorithms for Kidney Exchange. - Arnab Maiti; Palash Dey (IJCAI, 2022)

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. - Siddharth Barman; Arindam Khan 001; Arnab Maiti; Ayush Sawarni (AAAI, 2023)

Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games. - Arnab Maiti; Kevin G. Jamieson; Lillian J. Ratliff (AISTATS, 2023)

Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback. - Arnab Maiti; Kevin G. Jamieson; Lillian J. Ratliff (CoRR, 2023)

Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game. - Arnab Maiti; Ross Boczar; Kevin G. Jamieson; Lillian J. Ratliff (CoRR, 2023)

Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits. - Arnab Maiti; Ross Boczar; Kevin G. Jamieson; Lillian J. Ratliff (AISTATS, 2024)

On Binary Networked Public Goods Game with Altruism. - Arnab Maiti; Palash Dey (LATIN (2), 2024)

Query complexity of tournament solutions. - Arnab Maiti; Palash Dey (Theor. Comput. Sci., 2024)

On Parameterized Complexity of Binary Networked Public Goods Game. - Arnab Maiti; Palash Dey (Algorithmica, 2024)

Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games. - Arnab Maiti (COLT, 2025)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. - Arnab Maiti; Zhiyuan Fan; Kevin G. Jamieson; Lillian J. Ratliff; Gabriele Farina (COLT, 2025)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games Under Noisy Feedback. - Arnab Maiti; Kevin G. Jamieson; Lillian J. Ratliff (SAGT, 2025)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals. - Junyan Liu; Arnab Maiti; Artin Tajdini; Kevin G. Jamieson; Lillian J. Ratliff (CoRR, 2025)

Tight Approximation Algorithms for 2D Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ACM Trans. Algorithms, 2025)