Abstract
This paper introduces a componentwise joint receipt operation ⊕ on ann-component product set Πni=1gi, and develops an axiom system to justify an additive representation for a binary relation ≿ on Πni=1gi. Basically, our axiom system is similar to then-component (n≥ 3), additive conjoint structure. However, the introduction of the operation ⊕ yields two new axioms – additive solvability and invariance under multiplication – and hence we can weaken the independence axiom of the conjoint structure. The weakened independence axiom requires the independence of the order for each single factor from fixed levels of the other factors, while the conjoint structure involves the independence of the order for two or more factors. Finally, it is shown by a brief experimental test that the weakened independence axiom is sustained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Advanced Computational Intelligence and Intelligent Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
