Abstract

The difficulty of making social choices seems to take on two forms: one that is related to both preferences and the method used in aggregating them and one which is related to the preferences only. In the former type the difficulty has to do with the discrepancies of outcomes resulting from various preference aggregation methods and the computation of winners in elections. Some approaches and results which take their motivation from the computability theory are discussed. The latter ‘institution-free’ type of difficulty pertains to solution theory of the voting games. We discuss the relationships between various solution concepts, e.g. uncovered set, Banks set, Copeland winners. Finally rough sets are utilized in an effort to measure the difficulty of making social choices.