12 citations · 53 across the 19 of their papers we have counts for
5 papers · 1 filter
Intervention Efficient Algorithm for Two-Stage Causal MDPs
Rahul Madhavan, Aurghya Maiti, Gaurav Sinha +1
We study Markov Decision Processes (MDP) wherein states correspond to causal graphs that stochastically generate rewards. In this setup, the learner's goal is to identify atomic in…
Truthful and Fair Mechanisms for Matroid-Rank Valuations
Siddharth Barman, Paritosh Verma
We study the problem of allocating indivisible goods among strategic agents. We focus on settings wherein monetary transfers are not available and each agent's private valuation is…
Universal and Tight Online Algorithms for Generalized-Mean Welfare
Siddharth Barman, Arindam Khan, Arnab Maiti
We study fair and efficient allocation of divisible goods, in an online manner, among agents. The goods arrive online in a sequence of time periods. The agents' values for…
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations
Siddharth Barman, Paritosh Verma
We study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare-defined as the geometric mea…
Optimal Algorithms for Range Searching over Multi-Armed Bandits
Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul
This paper studies a multi-armed bandit (MAB) version of the range-searching problem. In its basic form, range searching considers as input a set of points (on the real line) and a…