Social choice and cooperative game theory: voting games as social aggregation functions

We consider voting games as procedures to aggregate individual preferences. We survey positive results on the nonemptiness of the core of voting games and explore other solutions concepts that are basic supersets of the core such as Rubinstein's stability set and two types of uncovered sets. We consider cases where the sets of alternatives are 'ordinary' sets, finite sets and infinite sets with possibly a topological structure.