11 citations · 35 across the 50 of their papers we have counts for
4 papers · 1 filter
When agents choose bundles autonomously: guarantees beyond discrepancy
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman +1
We consider the fair division of indivisible items among agents with additive non-negative normalized valuations, with the goal of obtaining high value guarantees, that is, clo…
Parameterized Complexity of Incomplete Connected Fair Division
Harmender Gahlawat, Meirav Zehavi
\textit{Fair division} of resources among competing agents is a fundamental problem in computational social choice and economic game theory. It has been intensively studied on vari…
Participatory Budgeting with Project Groups
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon +1
We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and…
On the (Parameterized) Complexity of Almost Stable Marriage
Sushmita Gupta, Pallavi Jain, Sanjukta Roy +2
In the Stable Marriage problem. when the preference lists are complete, all agents of the smaller side can be matched. However, this need not be true when preference lists are inco…