Search Results for author: Nawal Benabbou

Found 3 papers, 0 papers with code

RIGA: A Regret-Based Interactive Genetic Algorithm

no code implementations10 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.

Combinatorial Optimization

Finding Fair and Efficient Allocations When Valuations Don't Add Up

no code implementations16 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}.

Fairness

The Price of Quota-based Diversity in Assignment Problems

no code implementations28 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.