Barberà and Coelho (WP 264, CREA-Barcelona Economics, 2007) documented six screening rules associated with the rule of k names that are used by diferent institutions around the world. Here, we study whether these screening rules satisfy stability. A set is said to be a weak Condorcet set à la Gehrlein (Math Soc Sci 10:199-209) if no candidate in this set can be defeated by any candidate from outside the set on the basis of simple majority rule. We say that a screening rule is stable if it always selects a weak Condorcet set whenever such set exists. We show that all of the six procedures which are used in reality do violate stability if the voters do not act strategically. We then show that there are screening rules which satisfy stability. Finally, we provide two results that can explain the widespread use of unstable screening rules. © 2007 Springer-Verlag.
|Journal||Social Choice and Welfare|
|Publication status||Published - 1 Jun 2008|