9 citations · 14 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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.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…