activity
20122023
most citedA Bicriteria Approximation for the Reordering Buffer Problem

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.GTShow all

3 papers · 1 filter

cs.GT2023★ 1 cited

Fair Chore Division under Binary Supermodular Costs

Siddharth Barman, Vishnu V. Narayan, Paritosh Verma

We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary marginals. Such functions capture complemen…

cs.GT2022

Nash Welfare Guarantees for Fair and Efficient Coverage

Siddharth Barman, Anand Krishna, Y. Narahari +1

We study coverage problems in which, for a set of agents and a given threshold , the goal is to select subsets (of the agents) that, while satisfying combinatorial constrain…

cs.GT2014

Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem

Siddharth Barman

We present algorithmic applications of an approximate version of Carathéodory's theorem. The theorem states that given a set of vectors in , for every vector in t…