192 citations · 336 across the 18 of their papers we have counts for
4 papers · 1 filter
Maximin Share Guarantees via Limited Cost-Sensitive Sharing
Hana Salavcova, Martin Černý, Arpita Biswas
We study the problem of fairly allocating indivisible goods when limited sharing is allowed, that is, each good may be allocated to up to agents, while incurring a cost for sha…
On Achieving Leximin Fairness and Stability in Many-to-One Matchings
Shivika Narang, Arpita Biswas, Y Narahari
The past few years have seen a surge of work on fairness in allocation problems where items must be fairly divided among agents having individual preferences. In comparison, fairne…
Fair Division Under Cardinality Constraints
Siddharth Barman, Arpita Biswas
We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of th…
Groupwise Maximin Fair Allocation of Indivisible Goods
Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy +1
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fair…