3 papers
cs.GT2026
Condorcet-Winning Sets and Peer Selection in Planar Metric Elections
Gabriel de Azevedo, Ulysse Hennebelle
In ranked-choice voting, a Condorcet-winning set is a group of candidates for which no outside candidate is preferred to every member of the group by a majority of voters. We study…
math.OC2024
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
Omar El Housni, Ulysse Hennebelle, Alfredo Torrico
To address efficiency and design challenges in choice-based matching platforms, we introduce a two-sided assortment optimization framework under general choice preferences. The goa…
cs.NE2023
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise
Matthieu Dinot, Benjamin Doerr, Ulysse Hennebelle +1
In single-objective optimization, it is well known that evolutionary algorithms also without further adjustments can tolerate a certain amount of noise in the evaluation of the obj…