Efficient Uncoupled Learning Dynamics with ~O}(T<sup>-1/4</sup>) Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback.

[BibT_eX]

[DOI]

Arnab Maiti

Claire Jie Zhang

CoRR, February, 2026

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret.

[BibT_eX]

[DOI]

CoRR, February, 2026

2025

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback.

[BibT_eX]

[DOI]

CoRR, October, 2025

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

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., September, 2025

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2025

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games Under Noisy Feedback.

[BibT_eX]

[DOI]

Arnab Maiti

Kevin Jamieson

Lillian J. Ratliff

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

On the Universal Near Optimality of Hedge in Combinatorial Settings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Arnab Maiti

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

2024

Query complexity of tournament solutions.

[BibT_eX]

[DOI]

Arnab Maiti

Palash Dey

Theor. Comput. Sci., 2024

On Binary Networked Public Goods Game with Altruism.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Arnab Maiti

Kevin Jamieson

Lillian J. Ratliff

CoRR, 2023

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

[BibT_eX]

[DOI]

Arnab Maiti

Kevin 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.

[BibT_eX]

[DOI]

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

2022

Parameterized Algorithms for Kidney Exchange.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

On Parameterized Complexity of Binary Networked Public Goods Game.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

On Parameterized Complexity of Liquid Democracy.

[BibT_eX]

[DOI]

Palash Dey

Arnab Maiti

Amatya Sharma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Streaming Algorithms for Stochastic Multi-armed Bandits.

[BibT_eX]

[DOI]

Arnab Maiti

Vishakha Patil

Arindam Khan

CoRR, 2020

Arnab Maiti

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...