12 citations · 53 across the 19 of their papers we have counts for
22 papers · 1 filter
Parameterized Guarantees for Almost Envy-Free Allocations
Siddharth Barman, Debajyoti Kar, Shraddha Pathak
We study fair allocation of indivisible goods among agents with additive valuations. We obtain novel approximation guarantees for three of the strongest fairness notions in discret…
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
Siddharth Barman, Arindam Khan, Sudarshan Shyam +1
We study fair division of goods under the broad class of generalized assignment constraints. In this constraint framework, the sizes and values of the goods are agent-specific, and…
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…
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…
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…