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).

Following Sethuraman, Teo and Vohra ((2003), (2006)), we apply integer programming tools to the analysis of fundamental issues in social choice theory. We generalize Sethuraman et al.'s approach specifying integer programs in which variables are allowed to assume values in the set {0; 1/2 ; 1}....