We study the aggregation of partial orders into a complete ordering, and prove both possibility and impossibility results in this context. First, we show that the standard independence of irrelevant alternatives condition is stronger here since even dictatorial aggregation rules may fail to...

We reappraise the Arrow problem by studying the aggregation of choice functions. We do so in the general framework of judgment aggregation, in which choice functions are naturally representable by specifying, for each menu A and each alternative x in A, whether x is choosable from A, or not. Our...