A verification theorem of preference separability for additive value functions
From MaRDI portal
This paper offers an operational verification theorem of preference separability for additive value functions. Additive covering of the attribute index set plays a key role in the derivation. Effective ways for utilizing the theorem to derive additive value functions in terms of orthogonal square designs and progressive ways to determine the form of value functions are also discussed.
Recommendations
Cites work
- scientific article; zbMATH DE number 2086188 (Why is no real title available?)
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- scientific article; zbMATH DE number 3313066 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- scientific article; zbMATH DE number 3366923 (Why is no real title available?)
- scientific article; zbMATH DE number 3395595 (Why is no real title available?)
- scientific article; zbMATH DE number 3092990 (Why is no real title available?)
- Measurable Multiattribute Value Functions
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- The Structure of Utility Functions
Cited in
(4)- State-dependent weights in multicriteria value functions
- Assessing priority weights from subsets of pairwise comparisons in multiple criteria optimization problems
- scientific article; zbMATH DE number 3976685 (Why is no real title available?)
- On the preference characterization of additively separable utility
This page was built for publication: A verification theorem of preference separability for additive value functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094304)