Arnab Maiti
9 papers · 2021–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Interdisciplinary Bridge π§ Keyword Pioneer π Conference Polyglot (6) π Cross-Pollinator (8) πΊοΈ Taxonomy Completionist (13)
π₯
Unstoppable
(5)
Conferences
AAAI (2)
AISTATS (2)
COLT (2)
ICML (1)
IJCAI (1)
NIPS (1)
Top co-authors
Keywords
sample complexity
(3)
multi-armed bandit
(3)
nash equilibrium
(2)
online algorithm
(2)
zero-sum game
(2)
matrix game
(2)
nash social welfare
(1)
fair allocation
(1)
welfare maximization
(1)
parameterized algorithm
(1)
pure exploration
(1)
competitive ratio
(1)
dueling bandit
(1)
approximate equilibrium
(1)
stochastic observation
(1)
best-arm identification
(1)
kidney exchange
(1)
fixed-parameter tractable
(1)
geometric mean
(1)
welfare function
(1)
Papers
Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games
COLT 2025
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
ICML 2025
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
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
NIPS 2021