Arnab Maiti

40 papers A* 9A 4B 1Journal 24Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret.
CoRR
Shinji Ito, Haipeng Luo, Arnab Maiti, Taira Tsuchiya, Yue Wu
2026 J jnl
Efficient Uncoupled Learning Dynamics with ~O}(T
CoRR
Arnab Maiti, Claire Jie Zhang, Kevin Jamieson, Jamie H. Morgenstern, Ioannis Panageas, Lillian J. Ratliff
2026 J jnl
Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners.
CoRR
Arnab Maiti, Junyan Liu, Kevin Jamieson, Lillian J. Ratliff
2025 J jnl
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback.
CoRR
Shinji Ito, Kevin Jamieson, Haipeng Luo, Arnab Maiti, Taira Tsuchiya
2025 A* conf
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries.
COLT
Arnab Maiti, Zhiyuan Fan, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina
2025 J jnl
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries.
CoRR
Arnab Maiti, Zhiyuan Fan, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina
2025 A* conf
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals.
ICML
Junyan Liu, Arnab Maiti, Artin Tajdini, Kevin Jamieson, Lillian J. Ratliff
2025 J jnl
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals.
CoRR
Junyan Liu, Arnab Maiti, Artin Tajdini, Kevin Jamieson, Lillian J. Ratliff
2025 B conf
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games Under Noisy Feedback.
SAGT
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
2025 J jnl
On the Universal Near Optimality of Hedge in Combinatorial Settings.
CoRR
Zhiyuan Fan, Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina
2025 A* conf
Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games.
COLT
Arnab Maiti
2025 J jnl
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game.
ACM Trans. Economics and Comput.
Arnab Maiti, Ross Boczar, Kevin Jamieson, Lillian J. Ratliff
2025 J jnl
Tight Approximation Algorithms for 2D Guillotine Strip Packing.
ACM Trans. Algorithms
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2024 A conf
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits.
AISTATS
Arnab Maiti, Ross Boczar, Kevin Jamieson, Lillian J. Ratliff
2024 — conf
On Binary Networked Public Goods Game with Altruism.
LATIN (2)
Arnab Maiti, Palash Dey
2024 J jnl
On Parameterized Complexity of Binary Networked Public Goods Game.
Algorithmica
Arnab Maiti, Palash Dey
2024 J jnl
Query complexity of tournament solutions.
Theor. Comput. Sci.
Arnab Maiti, Palash Dey
2023 A* conf
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.
AAAI
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
2023 A conf
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games.
AISTATS
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
2023 J jnl
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games.
CoRR
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
2023 J jnl
Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback.
CoRR
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
2023 J jnl
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits.
CoRR
Arnab Maiti, Ross Boczar, Kevin Jamieson, Lillian J. Ratliff
2023 J jnl
Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game.
CoRR
Arnab Maiti, Ross Boczar, Kevin Jamieson, Lillian J. Ratliff
2022 J jnl
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.
CoRR
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
2022 J jnl
On Binary Networked Public Goods Game with Altruism.
CoRR
Arnab Maiti, Palash Dey
2022 A conf
On Parameterized Complexity of Binary Networked Public Goods Game.
AAMAS
Arnab Maiti, Palash Dey
2022 A conf
Parameterized Algorithms for Kidney Exchange.
AAMAS
Arnab Maiti, Palash Dey
2022 A* conf
Parameterized Algorithms for Kidney Exchange.
IJCAI
Arnab Maiti, Palash Dey
2022 J jnl
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing.
CoRR
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2022 A* conf
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.
ICALP
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2022 A* conf
Universal and Tight Online Algorithms for Generalized-Mean Welfare.
AAAI
Siddharth Barman, Arindam Khan, Arnab Maiti
2021 A* conf
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization.
NeurIPS
Arnab Maiti, Vishakha Patil, Arindam Khan
2021 A* conf
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
SoCG
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
2021 J jnl
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem.
CoRR
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
2021 — conf
On Parameterized Complexity of Liquid Democracy.
CALDAM
Palash Dey, Arnab Maiti, Amatya Sharma
2021 J jnl
Parameterized Algorithms for Kidney Exchange.
CoRR
Arnab Maiti, Palash Dey
2021 J jnl
Universal and Tight Online Algorithms for Generalized-Mean Welfare.
CoRR
Siddharth Barman, Arindam Khan, Arnab Maiti
2020 J jnl
On Parameterized Complexity of Binary Networked Public Goods Game.
CoRR
Arnab Maiti, Palash Dey
2020 J jnl
On Parameterized Complexity of Liquid Democracy.
CoRR
Palash Dey, Arnab Maiti, Amatya Sharma
2020 J jnl
Streaming Algorithms for Stochastic Multi-armed Bandits.
CoRR
Arnab Maiti, Vishakha Patil, Arindam Khan