9 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.GT2022★ 2 cited
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…
cs.GT2020★ 9 cited
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…