We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with...

We provide a respecification of an integer program characterization of Arrovian social welfare functions introduced by Sethuranam et al.(2003). By exploiting this respecification, we give a new and simpler proof of Theorem 2 in Kalai and Muller (1977).