Abstract
This article develops an axiom system to justify an additive representation for a preference relation on the product n i=1 Ai of extensive structures. The axiom system is basically similar to the n-component (n ≥ 3) additive conjoint structure, but the independence axiom is weakened in the system. That is, the axiom exclusively requires the independence of the order for each of single factors from fixed levels of the other factors. The introduction of a concatenation operation on each factor Ai makes it possible to yield a special type of restricted solvability, i.e., additive solvability and the usual cancellation on n i=1 Ai . In addition, the assumption of continuity and com- pleteness for Ai implies a stronger type of solvability on Ai . The additive solvability, cancellation, and stronger solvability axioms allow the weakened independence to be effective enough in constructing the additive representation.
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 callDisclaimer: 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.
