Arnab Maiti

According to our database, Arnab Maiti authored at least 21 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game.

Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff

ACM Trans. Economics and Comput., September, 2025

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese

ACM Trans. Algorithms, July, 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, May, 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

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 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

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games.

Arnab Maiti

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Query complexity of tournament solutions.

Arnab Maiti, Palash Dey

Theor. Comput. Sci., 2024

On Binary Networked Public Goods Game with Altruism.

Arnab Maiti, Palash Dey

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits.

Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

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

Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback.

Arnab Maiti, Kevin G. Jamieson, Lillian J. Ratliff

CoRR, 2023

Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games.

Arnab Maiti, Kevin G. Jamieson, Lillian J. Ratliff

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.

Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Parameterized Algorithms for Kidney Exchange.

Arnab Maiti, Palash Dey

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.

Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

On Parameterized Complexity of Binary Networked Public Goods Game.

Arnab Maiti, Palash Dey

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Universal and Tight Online Algorithms for Generalized-Mean Welfare.

Siddharth Barman, Arindam Khan, Arnab Maiti

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization.

Arnab Maiti, Vishakha Patil, Arindam Khan

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.

Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese

Proceedings of the 37th International Symposium on Computational Geometry, 2021

On Parameterized Complexity of Liquid Democracy.

Palash Dey, Arnab Maiti, Amatya Sharma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Streaming Algorithms for Stochastic Multi-armed Bandits.

Arnab Maiti, Vishakha Patil, Arindam Khan

CoRR, 2020