29 citations · 41 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020★ 29 cited
Finding Fair and Efficient Allocations When Valuations Don't Add Up
Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi +1
In this paper, we present new results on the fair and efficient allocation of indivisible goods to agents whose preferences correspond to {\em matroid rank functions}. This is a ve…
cs.AI2017★ 12 cited
The Price of Quota-based Diversity in Assignment Problems
Nawal Benabbou, Mithun Chakraborty, Vinh Ho Xuan +2
We introduce and analyze an extension to the matching problem on a weighted bipartite graph: Assignment with Type Constraints. The two parts of the graph are partitioned into subse…