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

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.

[1]  Jennifer Ryan,et al.  Matroid Applications and Algorithms , 1992, INFORMS J. Comput..

[2]  Patrice Perny,et al.  On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems , 2015, ADT.

[3]  Craig Boutilier,et al.  Regret-based Reward Elicitation for Markov Decision Processes , 2009, UAI.

[4]  Peter Haddawy,et al.  Problem-Focused Incremental Elicitation of Multi-Attribute Utility Models , 1997, UAI.

[5]  Jérôme Monnot,et al.  A Matroid Approach to the Worst Case Allocation of Indivisible Goods , 2013, IJCAI.

[6]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[7]  Toby Walsh,et al.  Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies , 2010, Artif. Intell..

[8]  Thibaut Lust,et al.  An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems , 2020, AAAI.

[9]  Craig Boutilier,et al.  Robust Approximation and Incremental Elicitation in Voting Protocols , 2011, IJCAI.

[10]  Craig Boutilier,et al.  Preference Elicitation and Interview Minimization in Stable Matchings , 2014, AAAI.

[11]  Patrice Perny,et al.  Incremental Weight Elicitation for Multiobjective State Space Search , 2015, AAAI.

[12]  Bruno Zanuttini,et al.  Interactive Value Iteration for Markov Decision Processes with Unknown Rewards , 2013, IJCAI.

[13]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[14]  Craig Boutilier,et al.  Constraint-based optimization and utility elicitation using the minimax decision criterion , 2006, Artif. Intell..

[15]  Patrice Perny,et al.  Combining Preference Elicitation and Search in Multiobjective State-Space Graphs , 2015, IJCAI.

[16]  Paolo Viappiani,et al.  Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems , 2017, Artif. Intell..

[17]  T. Magnanti,et al.  Some Abstract Pivot Algorithms , 1975 .

[18]  Jérôme Monnot,et al.  Near Fairness in Matroids , 2014, ECAI.

[19]  Jon Lee.  A First Course in Combinatorial Optimization , 2004 .

[20]  Daphne Koller,et al.  Making Rational Decisions Using Adaptive Utility Elicitation , 2000, AAAI/IAAI.

[21]  Patrice Perny,et al.  Interactive resolution of multiobjective combinatorial optimization problems by incremental elicitation of criteria weights , 2018 .

[22]  Patrice Perny,et al.  Incremental Elicitation of Rank-Dependent Aggregation Functions based on Bayesian Linear Regression , 2019, IJCAI.

[23]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[24]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[25]  James G. Oxley,et al.  Matroid theory , 1992 .

[26]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[27]  Craig Boutilier,et al.  Minimax regret based elicitation of generalized additive utilities , 2007, UAI.

[28]  Craig Boutilier,et al.  Incremental utility elicitation with minimax regret decision criterion , 2003, IJCAI 2003.

[29]  Andrew P. Sage,et al.  A model of multiattribute decisionmaking and trade-off weight determination under uncertainty , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[30]  Patrice Perny,et al.  Adaptive Elicitation of Preferences under Uncertainty in Sequential Decision Making Problems , 2017, IJCAI.