UTA-poly and UTA-splines: additive value functions with polynomial marginals

03/05/2016
by   Olivier Sobrie, et al.
0

Additive utility function models are widely used in multiple criteria decision analysis. In such models, a numerical value is associated to each alternative involved in the decision problem. It is computed by aggregating the scores of the alternative on the different criteria of the decision problem. The score of an alternative is determined by a marginal value function that evolves monotonically as a function of the performance of the alternative on this criterion. Determining the shape of the marginals is not easy for a decision maker. It is easier for him/her to make statements such as "alternative a is preferred to b". In order to help the decision maker, UTA disaggregation procedures use linear programming to approximate the marginals by piecewise linear functions based only on such statements. In this paper, we propose to infer polynomials and splines instead of piecewise linear functions for the marginals. In this aim, we use semidefinite programming instead of linear programming. We illustrate this new elicitation method and present some experimental results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2011

Solving Factored MDPs with Hybrid State and Action Variables

Efficient representations and solutions for large decision problems with...
research
10/12/2019

A preference learning framework for multiple criteria sorting with diverse additive value models and valued assignment examples

We present a preference learning framework for multiple criteria sorting...
research
07/26/2021

A Comparison of Various Aggregation Functions in Multi-Criteria Decision Analysis for Drug Benefit-Risk Assessment

Multi-criteria decision analysis (MCDA) is a quantitative approach to th...
research
05/15/2019

Electre-Score: A first outranking based method for scoring actions

In this paper we present (to the best of our knowledge) the first outran...
research
07/04/2012

Approximate Linear Programming for First-order MDPs

We introduce a new approximate solution technique for first-order Markov...
research
10/16/2012

Value Function Approximation in Noisy Environments Using Locally Smoothed Regularized Approximate Linear Programs

Recently, Petrik et al. demonstrated that L1Regularized Approximate Line...
research
11/15/2022

Optimizing Polymatroid Functions

We consider a class of optimization problems that involve determining th...

Please sign up or login with your details

Forgot password? Click here to reset