Explaining robust additive utility models by sequences of preference swaps

详细信息    查看全文

• 作者：K. Belahcene ; C. Labreuche ; N. Maudet ; V. Mousseau ; W. Ouerdane
• 关键词：Multicriteria decision making ; Explanation ; Necessary preference relation
• 刊名：Theory and Decision
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：82
• 期：2
• 页码：151-183
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Economic Theory/Quantitative Economics/Mathematical Methods; Game Theory, Economics, Social and Behav. Sciences; Operation Research/Decision Theory; Behavioral/Experimental Economics; Statistics for B
• 出版者：Springer US
• ISSN：1573-7187
• 卷排序：82

文摘

As decision-aiding tools become more popular everyday—but at the same time more sophisticated—it is of utmost importance to develop their explanatory capabilities. Some decisions require careful explanations, which can be challenging to provide when the underlying mathematical model is complex. This is the case when recommendations are based on incomplete expression of preferences, as the decision-aiding tool has to infer despite this scarcity of information. This step is key in the process but hardly intelligible for the user. The robust additive utility model is a necessary preference relation which makes minimal assumptions, at the price of handling a collection of compatible utility functions, virtually impossible to exhibit to the user. This strength for the model is a challenge for the explanation. In this paper, we come up with an explanation engine based on sequences of preference swaps, that is, pairwise comparison of alternatives. The intuition is to confront the decision maker with “elementary” comparisons, thus building incremental explanations. Elementary here means that alternatives compared may only differ on two criteria. Technically, our explanation engine exploits some properties of the necessary preference relation that we unveil in the paper. Equipped with this, we explore the issues of the existence and length of the resulting sequences. We show in particular that in the general case, no bound can be given on the length of explanations, but that in binary domains, the sequences remain short.