Arnab Maiti

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 27

Top Topics

Multi Armed Bandit

Approximation Algorithms

Parameterized Complexity

Top Venues

Publications

Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits. AISTATS (2024)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. Algorithmica 86 (1) (2024)
Arnab Maiti, Palash Dey
Query complexity of tournament solutions. Theor. Comput. Sci. 991 (2024)
Arnab Maiti, Palash Dey
On Binary Networked Public Goods Game with Altruism. LATIN (2) (2024)
Arnab Maiti, Kevin G. Jamieson, Lillian J. Ratliff
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games. AISTATS (2023)
Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff
Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game. CoRR (2023)
Arnab Maiti, Kevin G. Jamieson, Lillian J. Ratliff
Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback. CoRR (2023)
Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits. CoRR (2023)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI (2023)
Arnab Maiti, Kevin G. Jamieson, Lillian J. Ratliff
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games. CoRR (2023)
Arnab Maiti, Palash Dey
On Binary Networked Public Goods Game with Altruism. CoRR (2022)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. IJCAI (2022)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. AAMAS (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP (2022)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. AAMAS (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing. CoRR (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI (2022)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. CoRR (2021)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR (2021)
Palash Dey, Arnab Maiti, Amatya Sharma
On Parameterized Complexity of Liquid Democracy. CALDAM (2021)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. CoRR (2021)
Arnab Maiti, Vishakha Patil, Arindam Khan
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. NeurIPS (2021)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. SoCG (2021)
Palash Dey, Arnab Maiti, Amatya Sharma
On Parameterized Complexity of Liquid Democracy. CoRR (2020)
Arnab Maiti, Vishakha Patil, Arindam Khan
Streaming Algorithms for Stochastic Multi-armed Bandits. CoRR (2020)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. CoRR (2020)