Arnab Maiti*, Ross Boczar*, Kevin Jamieson, Lillian Ratliff: Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits. Full paper appeared at AISTATS 2024 [Paper].
Arnab Maiti* , Palash Dey: Query complexity of tournament solutions. Published at Journal of Theoretical Computer Science [Paper].
Arnab Maiti* , Palash Dey: On Binary Networked Public Goods Game with Altruism. Full paper appeared at LATIN 2024 [Paper].
Arnab Maiti*, Kevin Jamieson, Lillian Ratliff: Instance-dependent Bounds for Zero-sum Matrix Games. Full paper appeared at AISTATS 2023 [Paper].
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni: Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. Full paper appeared at AAAI 2023 and is selected for Oral Presentation. [Paper]
Arnab Maiti*, Palash Dey: Parameterized Algorithms for Kidney Exchange.
Full paper is published at IJCAI 2022, Extended abstract is published at AAMAS 2022 [Paper]
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese: Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing.
Published in International Colloquium on Automata, Languages and Programming (ICALP) 2022 [Paper]
Arnab Maiti*, Palash Dey: On Parameterized Complexity of Binary Networked Public Goods Game.
Full paper is published at AAMAS 2022 [Paper]
Siddharth Barman, Arindam Khan, Arnab Maiti: Universal and Tight Online Algorithms for Generalized-Mean Welfare.
Published at AAAI 2022 and also selected for Oral Presentation [Paper]
Arnab Maiti*, Vishakha Patil, Arindam Khan: Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization.
Published at NeurIPS 2021 [Paper] [Talk by Arnab Maiti] [Slides]
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese : On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
Symposium on Computational Geometry (SoCG) 2021: 48:1-48:17
[Paper] [Talk by Arnab Maiti] [Slides] [Our paper also featured in Highlights of Algorithms 2021]
Palash Dey, Arnab Maiti, Amatya Sharma: On Parameterized Complexity of Liquid Democracy.
Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2021: 83-94
[Paper] [Joint Talk by Amatya Sharma and Arnab Maiti] [Slides]