On strategy-proof social choice under categorization

I consider social choice problems such that (i) the set of alternatives can be partitioned into categories based on a prominent and objective feature and (ii) agents have strict preferences over the alternatives. Main results are characterizations of the structure of the strategy-proof social choice functions. I prove that each social choice function is strategy-proof if and only if it is decomposable into “small” strategy-proof social choice functions; one of them chooses one category and each of the others chooses one alternative from a category.