Scalable choice models

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.