Feasible Elimination Procedures in Social Choice: An Axiomatic Characterization

Feasible elimination procedures (peleg, 1978) play a central role in constructing social choice functions which have the following property: in the associated game form, for any preference profile there exists a strong nash equilibrium resulting in the sincere outcome. In this paper we provide an axiomatic characterization of the social choice correspondences resulting from applying feasible elimination procedures. The axioms are anonymity, maskin monotonicity, and independent blocking. We also show that these axioms are logically independent.