Maiti, Arnab

11 publications

NeurIPS 2025 Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback Shinji Ito, Kevin Jamieson, Haipeng Luo, Arnab Maiti, Taira Tsuchiya

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 Jamieson, Lillian J. Ratliff, Gabriele Farina

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

NeurIPS 2025 On the Universal near Optimality of Hedge in Combinatorial Settings Zhiyuan Fan, Arnab Maiti, Lillian J. Ratliff, Kevin Jamieson, Gabriele Farina

COLT 2025 Open Problem: Optimal Instance-Dependent Sample Complexity for Finding Nash Equilibrium in Two Player Zero-Sum Matrix Games Arnab Maiti

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

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

AISTATS 2023 Instance-Dependent Sample Complexity Bounds for Zero-Sum Matrix Games Arnab Maiti, Kevin Jamieson, Lillian Ratliff

IJCAI 2022 Parameterized Algorithms for Kidney Exchange Arnab Maiti, Palash Dey

AAAI 2022 Universal and Tight Online Algorithms for Generalized-Mean Welfare Siddharth Barman, Arindam Khan, Arnab Maiti

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