Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization - Sorbonne Université Access content directly
Conference Papers Year : 2021

Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization

Nawal Benabbou
Cassandre Leroy
  • Function : Author
Thibaut Lust
Patrice Perny

Abstract

We propose two incremental preference elicitation methods for interactive preference-based optimization on weighted matroid structures. More precisely, for linear objective (utility) functions, we propose an interactive greedy algorithm interleaving preference queries with the incremental construction of an independent set to obtain an optimal or nearoptimal base of a matroid. We also propose an interactive local search algorithm based on sequences of possibly improving exchanges for the same problem. For both algorithms, we provide performance guarantees on the quality of the returned solutions and the number of queries. Our algorithms are tested on the uniform, graphical and scheduling matroids to solve three different problems (committee election, spanning tree, and scheduling problems) and evaluated in terms of computation times, number of queries, and empirical error.
Fichier principal
Vignette du fichier
AAAI2021FinalVersion (1).pdf (513.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03106084 , version 1 (09-02-2021)
hal-03106084 , version 2 (30-04-2021)

Identifiers

  • HAL Id : hal-03106084 , version 2

Cite

Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny. Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization. 35th AAAI Conference on Artificial Intelligence (AAAI'21), Feb 2021, Virtual, France. ⟨hal-03106084v2⟩
143 View
100 Download

Share

Gmail Mastodon Facebook X LinkedIn More