A characterization of social choice correspondences that implement the core of simple games (Q957863): Difference between revisions

The authors consider voting games satisfying Nakamura's inequality (Nakamura's number is greater than the number of alternatives; the core of such games is non-empty). Their objective is to find conditions on social choice correspondences such that the set of selected alternatives for any profile coincides with the core of some voting game. They show that such conditions are weak Pareto property, Maskin monotonicity, weak neutrality and weak decisiveness (when individual preferences are weak orderings).