9 citations · 14 across the 4 of their papers we have counts for
4 papers
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…
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations
Siddharth Barman, Anand Krishna, Y. Narahari +1
We study the problem of allocating indivisible goods among agents in a fair manner. While envy-free allocations of indivisible goods are not guaranteed to exist, envy-freeness can…
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
Siddharth Barman, Anand Krishna, Pooja Kulkarni +1
We study the problem of allocating indivisible goods among agents with the objective of maximizing Nash social welfare (NSW). This welfare function is defined as the geometric…
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations
Siddharth Barman, Umang Bhaskar, Anand Krishna +1
We develop polynomial-time algorithms for the fair and efficient allocation of indivisible goods among agents that have subadditive valuations over the goods. We first consider…