A verification theorem of preference separability for additive value functions
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.
scientific article; zbMATH DE number 4025110