On the Universal Near Optimality of Hedge in Combinatorial Settings
Zhiyuan Fan*, Arnab Maiti*, Kevin Jamieson, Lillian Ratliff, Gabriele Farina
NeurIPS 2025 (Spotlight) [Paper]
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
Shinji Ito, Kevin Jamieson, Haipeng Luo, Arnab Maiti, Taira Tsuchiya
NeurIPS 2025 [Paper]
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
Arnab Maiti*, Kevin Jamieson, Lillian Ratliff
SAGT 2025 [Paper]
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 Ratliff, Gabriele Farina
COLT 2025 [Paper]
Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games
Arnab Maiti
COLT 2025 [Paper]
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
Junyan Liu*, Arnab Maiti*, Artin Tajdini*, Kevin Jamieson, Lillian Ratliff
ICML 2025 [Paper]
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
Arnab Maiti*, Ross Boczar, Kevin Jamieson, Lillian Ratliff
ACM Transactions on Economics and Computation [Paper]
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
Arnab Maiti*, Ross Boczar*, Kevin Jamieson, Lillian Ratliff
AISTATS 2024 [Paper]
Query complexity of tournament solutions
Arnab Maiti*, Palash Dey
Journal of Theoretical Computer Science [Paper]
On Binary Networked Public Goods Game with Altruism
Arnab Maiti*, Palash Dey
LATIN 2024 [Paper]
Instance-dependent Bounds for Zero-sum Matrix Games
Arnab Maiti*, Kevin Jamieson, Lillian Ratliff
AISTATS 2023 [Paper]
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
AAAI 2023 (Oral Presentation) [Paper]
Parameterized Algorithms for Kidney Exchange
Arnab Maiti*, Palash Dey
Published at IJCAI 2022; extended abstract at AAMAS 2022 [Paper]
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Published at ICALP 2022. Journal version accepted at TALG [Paper].
On Parameterized Complexity of Binary Networked Public Goods Game
Arnab Maiti*, Palash Dey
Published at AAMAS 2022. Journal version published at Algorithmica [Paper]
Universal and Tight Online Algorithms for Generalized-Mean Welfare
Siddharth Barman, Arindam Khan, Arnab Maiti
AAAI 2022 (Oral Presentation) [Paper]
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization
Arnab Maiti*, Vishakha Patil, Arindam Khan
NeurIPS 2021 [Paper] [Talk by Arnab Maiti] [Slides]
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
Published at SoCG 2021. Also featured in Highlights of Algorithms 2021.
[Paper] [Talk by Arnab Maiti] [Slides] [Our paper also featured in Highlights of Algorithms 2021]
On Parameterized Complexity of Liquid Democracy
Palash Dey, Arnab Maiti, Amatya Sharma
CALDAM 2021
[Paper] [Joint Talk by Amatya Sharma and Arnab Maiti] [Slides]