no code implementations • 10 Nov 2023 • Nawal Benabbou, Cassandre Leroy, Thibaut Lust
Our algorithm, called RIGA, can be applied to any multi-objective combinatorial optimization problem provided that the aggregation function is linear in its parameters and that a (near-)optimal solution can be efficiently determined for the problem with known preferences.
no code implementations • 16 Mar 2020 • Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick
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}.
no code implementations • 28 Nov 2017 • Nawal Benabbou, Mithun Chakraborty, Vinh Ho Xuan, Jakub Sliwinski, Yair Zick
The two parts of the graph are partitioned into subsets called types and blocks; we seek a matching with the largest sum of weights under the constraint that there is a pre-specified cap on the number of vertices matched in every type-block pair.