Abstract
Two representational criteria for probabilistic choice models are studied. These criteria, called scalability and weak scalability, are shown to be characterized by behavioral axioms designated, respectively, as pairwise dependence and weak pairwise dependence. The former is shown to be equivalent to the order independence axiom of Tversky. In addition, structural conditions on the choice alternatives are established under which all axioms are equivalent.
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 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.
