Arnab Maiti

11 papers · 2021–2026 · 6 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓

+3 more ↓

🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (17)

🧬 Topic Evolution 🔥 Unstoppable · Bronze 💎 Century Club · Bronze

Venues

COLT (4) AAAI (2) AISTATS (2) ICML (1) IJCAI (1) NeurIPS (1)

Top co-authors

Kevin Jamieson (5) Arindam Khan (3) Lillian Ratliff (2) Siddharth Barman (2) Lillian J. Ratliff (2) Vishakha Patil (1) Gabriele Farina (1) Artin Tajdini (1) Shinji Ito (1) Yue Wu (1)

Research topics

Mathematics & Optimization (9) Optimization (9) Machine Learning (8) Optimization & Theory (6) Learning Types (5) Artificial Intelligence (4) Core AI (4) Mathematics (2) Reinforcement Learning (1) Applications (1)

Keywords

sample complexity (4) nash equilibrium (3) multi-armed bandit (3) zero-sum game (3) regret bound (3) online algorithm (2) bandit feedback (2) matrix game (2) resource allocation (1) regret (1) graph matching (1) zero-sum matrix games (1) best arm identification (1) regret minimization (1) stochastic bandit (1) greedy selection (1) adversarial learning (1) nash social welfare (1) lipschitz constant (1) stochastic optimization (1)

Papers

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret COLT 2026 On the Power of Adaptivity for ε-Best Arm Identification in Linear Bandits COLT 2026 Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025 Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals ICML 2025 Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games COLT 2025 Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits AISTATS 2024 Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023 Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games AISTATS 2023 Parameterized Algorithms for Kidney Exchange IJCAI 2022 Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022 Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NeurIPS 2021