02/02/2021

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

Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny

Keywords:

Abstract Paper Similar Papers

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 near-optimal 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.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38948952
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AAAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 16:47 
 0
 0
 0
 0
 14:18 
 0
 0
 0
 0
 12:49 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 8:36 
 0
 0
 0
 0
 5:19 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 16:03 
 0
 0
 0
 0
 3:12 
 0
 0
 0
 0
 13:19 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 19:55 
 0
 0
 0
 0
 12:38 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 15:16 
 0
 0
 0
 0
 4:55 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 18:58 
 0
 0
 0
 0
 14:00 
 0
 0
 0
 0
 16:39 
 0
 0
 0
 0
 14:35 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 20:36 
 0
 0
 0
 0
 12:57 
 0
 0
 0
 0
 11:20 
 0
 0
 0
 0
 14:51 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 15:32 
 0
 0
 0
 0
 13:50 
 0
 0
 0
 0
 14:49 
 0
 0
 0
 0
 18:18 
 0
 0
 0
 0
 2:54 
 0
 0
 0
 0
 16:37 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 5:53 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 5:14 
 0
 0
 0
 0
 22:51