CUT: a multicriteria approach for concavifiable preferences

Nikolaos Argyris, Alec Morton, José Rui Figuerira

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We consider the problem of helping a decision maker (DM) choose from a set of multiattributed objects when her preferences are “concavifiable,” i.e. representable by a concave value function. We establish conditions under which preferences or preference intensities are concavifiable. We also derive a characterization for the family of concave value functions compatible with a set of such preference statements expressed by the DM. This can be used to validate dominance relations over discrete sets of alternatives and forms the basis of an interactive procedure. We report on the practical use of this procedure with several DMs for a flat-choice problem and its computational performance on a set of project-portfolio selection problem instances. The use of preference intensities is found to provide significant improvements to the performance of the procedure.
LanguageEnglish
Pages633 - 642
Number of pages10
JournalOperations Research
Volume62
Issue number3
Early online date9 Jun 2014
DOIs
Publication statusPublished - Jun 2014

Fingerprint

Multi-criteria
Decision maker
Value function
Project portfolio
Portfolio selection

Keywords

  • CUT
  • multicriteria approach
  • concavifiable preferences
  • concave value function

Cite this

Argyris, Nikolaos ; Morton, Alec ; Figuerira, José Rui. / CUT : a multicriteria approach for concavifiable preferences. In: Operations Research. 2014 ; Vol. 62, No. 3. pp. 633 - 642.
@article{6911fec2d2fc46a4b0d35d13970a57c4,
title = "CUT: a multicriteria approach for concavifiable preferences",
abstract = "We consider the problem of helping a decision maker (DM) choose from a set of multiattributed objects when her preferences are “concavifiable,” i.e. representable by a concave value function. We establish conditions under which preferences or preference intensities are concavifiable. We also derive a characterization for the family of concave value functions compatible with a set of such preference statements expressed by the DM. This can be used to validate dominance relations over discrete sets of alternatives and forms the basis of an interactive procedure. We report on the practical use of this procedure with several DMs for a flat-choice problem and its computational performance on a set of project-portfolio selection problem instances. The use of preference intensities is found to provide significant improvements to the performance of the procedure.",
keywords = "CUT, multicriteria approach, concavifiable preferences, concave value function",
author = "Nikolaos Argyris and Alec Morton and Figuerira, {Jos{\'e} Rui}",
note = "accepted at the journal 7/2/14",
year = "2014",
month = "6",
doi = "10.1287/opre.2014.1274",
language = "English",
volume = "62",
pages = "633 -- 642",
journal = "Operations Research",
issn = "0030-364X",
number = "3",

}

CUT : a multicriteria approach for concavifiable preferences. / Argyris, Nikolaos; Morton, Alec; Figuerira, José Rui.

In: Operations Research, Vol. 62, No. 3, 06.2014, p. 633 - 642.

Research output: Contribution to journalArticle

TY - JOUR

T1 - CUT

T2 - Operations Research

AU - Argyris, Nikolaos

AU - Morton, Alec

AU - Figuerira, José Rui

N1 - accepted at the journal 7/2/14

PY - 2014/6

Y1 - 2014/6

N2 - We consider the problem of helping a decision maker (DM) choose from a set of multiattributed objects when her preferences are “concavifiable,” i.e. representable by a concave value function. We establish conditions under which preferences or preference intensities are concavifiable. We also derive a characterization for the family of concave value functions compatible with a set of such preference statements expressed by the DM. This can be used to validate dominance relations over discrete sets of alternatives and forms the basis of an interactive procedure. We report on the practical use of this procedure with several DMs for a flat-choice problem and its computational performance on a set of project-portfolio selection problem instances. The use of preference intensities is found to provide significant improvements to the performance of the procedure.

AB - We consider the problem of helping a decision maker (DM) choose from a set of multiattributed objects when her preferences are “concavifiable,” i.e. representable by a concave value function. We establish conditions under which preferences or preference intensities are concavifiable. We also derive a characterization for the family of concave value functions compatible with a set of such preference statements expressed by the DM. This can be used to validate dominance relations over discrete sets of alternatives and forms the basis of an interactive procedure. We report on the practical use of this procedure with several DMs for a flat-choice problem and its computational performance on a set of project-portfolio selection problem instances. The use of preference intensities is found to provide significant improvements to the performance of the procedure.

KW - CUT

KW - multicriteria approach

KW - concavifiable preferences

KW - concave value function

U2 - 10.1287/opre.2014.1274

DO - 10.1287/opre.2014.1274

M3 - Article

VL - 62

SP - 633

EP - 642

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 3

ER -