Conjointness as a derived property

additive representation automorphism groups Cartesian product structure conjoint structure factorizable automorphism independent components lattice partial order psychological tests weak order

Mathematics Subject Classification ID

Ordered sets (06A99) Mathematical psychology (91E99)

Review text

The author investigates the question of which conditions imposed on a weak order (A,\(\preccurlyeq)\) allow for a representation of (A,\(\preccurlyeq)\) as a Cartesian product structure \((X_ 1,X_ 2,\preccurlyeq ')\) with independent components \(X_ 1\), \(X_ 2\) and a weak order \(\preccurlyeq '\) on \(X_ 1\times X_ 2\). Two possibilities are analyzed: first, two weak orders on A are supposed to exist in addition to \(\preccurlyeq\) and a compatibility condition between all three is shown to yield the decomposition; second, one additional weak order, together with a relation which reflects the compensatory trade-off components typically exhibit in an additive representation, is demonstrated to give essentially the same result. Furthermore, this paper deals with the automorphism groups of these structures and relates them to the important concept of a factorizable automorphism of a conjoint structure. A generalization to more than two components is presented and it is shown that the compatibility between the weak orders gives rise to a partial order or, if additional assumptions are met, even to a lattice. An application is also discussed of one of the theorems to the theory of psychological tests.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Conjointness as a derived property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584115)