research
∙
06/22/2023
Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback
This paper considers a variant of zero-sum matrix games where at each ti...
share
research
∙
03/19/2023
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
We study the sample complexity of identifying an approximate equilibrium...
research
∙
05/27/2022
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
We extend the notion of regret with a welfarist perspective. Focussing o...
research
∙
05/01/2022
On Binary Networked Public Goods Game with Altruism
In the classical Binary Networked Public Goods (BNPG) game, a player can...
research
∙
02/12/2022
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing
In the Strip Packing problem (SP), we are given a vertical half-strip [0...
research
∙
12/19/2021
Parameterized Algorithms for Kidney Exchange
In kidney exchange programs, multiple patient-donor pairs each of whom a...
research
∙
09/02/2021
Universal and Tight Online Algorithms for Generalized-Mean Welfare
We study fair and efficient allocation of divisible goods, in an online ...
research
∙
03/17/2021
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
In two-dimensional geometric knapsack problem, we are given a set of n a...
research
∙
12/09/2020
Streaming Algorithms for Stochastic Multi-armed Bandits
We study the Stochastic Multi-armed Bandit problem under bounded arm-mem...
research
∙
12/03/2020
On Parameterized Complexity of Binary Networked Public Goods Game
In the Binary Networked Public Goods game, every player needs to decide ...
research
∙
11/28/2020
