A preference aggregation method through the estimation of utility intervals

نویسندگان

  • Ying-Ming Wang
  • Jian-Bo Yang
  • Dong-Ling Xu
چکیده

In this paper, a preference aggregation method is developed for ranking alternative courses of actions by combining preference rankings of alternatives given on individual criteria or by individual decision makers. In the method, preference rankings are viewed as constraints on alternative utilities, which are normalized, and linear programming models are constructed to estimate utility intervals, which are weighted and averaged to generate an aggregated utility interval. A simple yet pragmatic interval ranking method is used to compare and/or rank alternatives. The 5nal ranking is generated as the most likely ranking with certain degrees of belief. Three numerical examples are examined to illustrate the potential applications of the proposed method. Scope and purpose The aggregation of preference rankings has wide applications in group decision making, social choice, committee election and voting systems. The purpose of this paper is to develop a preference aggregation method through the estimation of utility intervals, in which preference rankings are associated with utility intervals that are estimated using linear programming models and aggregated using the simple additive weighting method. ? 2004 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utility Estimation of Health Status of Cancer Patients by Mapping for Cost-Utility Analysis

Background: It is important to obtain accurate information about the preferences of people for measuring quality-adjusted life years (QALYs), because it is necessary for cost-utility analysis. In this regard, mapping is a method to access this information. Therefore, the purpose of this study was to map Functional Assessment of Cancer Therapy – General (FACT-G) onto Short Form Six Dimension (SF...

متن کامل

On Calibration and Application of Logit-Based Stochastic Traffic Assignment Models

There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...

متن کامل

Interactive multiple objective programming in optimization of the fully fuzzy quadratic programming problems

In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered.  To optimize th...

متن کامل

Rank aggregation methods comparison: A case for triage prioritization

This paper seeks to test and to determine a suitable aggregation method to represent a set of rankings made by individual decision makers (DMs). A case study for triage prioritization is used to test the aggregation methods. The triage is a decision-making process with which patients are prioritized according to their medical condition and chance of survival on arrival at the emergency departme...

متن کامل

Multiple utility constrained multi-objective programs using Bayesian theory

A utility function is an important tool for representing a DM’s preference. We adjoin utility functions to multi-objective optimization problems. In current studies, usually one utility function is used for each objective function. Situations may arise for a goal to have multiple utility functions. Here, we consider a constrained multi-objective problem with each objective having multiple utili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2005