Approximating DEX Utility Functions with Methods UTA and ACUTA
نویسندگان
چکیده
منابع مشابه
Approximating Dex Utility Functions with Methods Uta and Acuta
DEX is a qualitative multi-criteria decision analysis (MCDA) method, aimed at supporting decision makers in evaluating and choosing decision alternatives. We present results of a preliminary study in which we experimentally assessed the performance of two wellknown MCDA methods UTA and ACUTA to approximate qualitative DEX utility functions with piecewise-linear marginal utility functions. This ...
متن کاملMulti-level methods and approximating distribution functions
Biochemical reaction networks are often modelled using discrete-state, continuoustime Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie’s di...
متن کاملUTA - NM: Explaining Stated Preferences with Additive Non-Monotonic Utility Functions
UTA methods use linear programming techniques for finding additive utility functions that best explain stated preferences. However, most UTA methods including the popular UTA-Star are limited to monotonic preferences. UTA-NM (Non Monotonic) is inspired by UTA Star but allows non-monotonic partial utility functions if they decrease total model error. The shape of the utility functions is determi...
متن کاملUTA-poly and UTA-splines: additive value functions with polynomial marginals
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 monotonical...
متن کاملFinite difference methods for approximating Heaviside functions
We present a finite difference method for discretizing a Heaviside function H(u(~x)), where u is a level set function u : Rn 7→ R that is positive on a bounded region Ω ⊂ R. There are two variants of our algorithm, both of which are adapted from finite difference methods that we proposed for discretizing delta functions in [13–15]. We consider our approximate Heaviside functions as they are use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Security Education Journal (ISEJ)
سال: 2019
ISSN: 2349-817X,2349-8161
DOI: 10.6025/isej/2019/6/1/1-8