A preference elicitation approach for the ordered weighted averaging criterion solution choice observations

被引:4
作者
Baak, Werner [1 ]
Goerigk, Marc [1 ]
Hartisch, Michael [2 ]
机构
[1] Univ Passau, Business Decis & Data Sci, Dr Hans Kapfinger Str 30, D-94032 Passau, Germany
[2] Univ Siegen, Network & Data Sci Management, Unteres Schloss 3, D-57072 Siegen, Germany
关键词
Multiple criteria analysis; Decision making under uncertainty; Preference elicitation; Ordered weighted averaging; COMBINATORIAL OPTIMIZATION PROBLEMS; AGGREGATION OPERATORS; OWA;
D O I
10.1016/j.ejor.2023.11.020
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Decisions under uncertainty or with multiple objectives usually require the decision maker to formulate a preference regarding risks or trade-offs. If this preference is known, the ordered weighted averaging (OWA) criterion can be applied to aggregate scenarios or objectives into a single function. Formulating this preference, however, can be challenging, as we need to make explicit what is usually only implicit knowledge. We explore an optimization -based method of preference elicitation to identify appropriate OWA weights. We follow a datadriven approach, assuming the existence of observations, where the decision maker has chosen the preferred solution, but otherwise remains passive during the elicitation process. We then use these observations to determine the underlying preference by finding the preference vector that is at minimum distance to the polyhedra of feasible vectors for each of the observations. Using our optimization -based model, weights are determined by solving an alternating sequence of linear programs and standard OWA problems. Numerical experiments on risk -averse preference vectors for selection, assignment and knapsack problems show that our passive elicitation method compares well against having to conduct pairwise comparisons and performs particularly well when there are inconsistencies in the decision maker's choices.
引用
收藏
页码:1098 / 1110
页数:13
相关论文
共 51 条
[1]  
Adam L, 2021, PR MACH LEARN RES, V161, P718
[3]   Min-max and min-max regret versions of combinatorial optimization problems: A survey [J].
Aissi, Hassene ;
Bazgan, Cristina ;
Vanderpooten, Daniel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) :427-438
[4]   Minimax regret approaches for preference elicitation with rank-dependent aggregators [J].
Benabbou, Nawal ;
Gonzales, Christophe ;
Perny, Patrice ;
Viappiani, Paolo .
EURO JOURNAL ON DECISION PROCESSES, 2015, 3 (1-2) :29-64
[5]   Constructing Uncertainty Sets for Robust Linear Optimization [J].
Bertsimas, Dimitris ;
Brown, David B. .
OPERATIONS RESEARCH, 2009, 57 (06) :1483-1495
[6]  
Bourdache Nadjet, 2017, Algorithmic Decision Theory. 5th International Conference, ADT 2017. Proceedings: LNAI 10576, P93, DOI 10.1007/978-3-319-67504-6_7
[7]  
Bourdache N., 2020, DA2PL 2020-from multiple criteria decision aid to preference learning
[8]  
Bourdache N, 2019, AAAI CONF ARTIF INTE, P7741
[9]   Evaluating the risk of failure using the fuzzy OWA and DEMATEL method [J].
Chang, Kuei-Hu ;
Cheng, Ching-Hsue .
JOURNAL OF INTELLIGENT MANUFACTURING, 2011, 22 (02) :113-129
[10]   Approximating combinatorial optimization problems with the ordered weighted averaging criterion [J].
Chassein, Andre ;
Goerigk, Marc ;
Kasperski, Adam ;
Zielinski, Pawel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 286 (03) :828-838