Rubinstein2005-page137

Rubinstein2005-page137 - x i y for all i G 1 and y i x for...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
October 21, 2005 12:18 master Sheet number 135 Page number 119 Social Choice 119 Let c be a third alternative. Let ( ± i ) i N be a profile satisfying a ± i b iff a ± ² i b for all i , and for all i G , a ± i c ± i b ± i x for every x X { a , b , c } and for all j / G , c ± j y ± j x for every y ∈{ a , b } and for every x X −{ a , b , c } . Since G is almost decisive, a ± c .By Par , c ± b , therefore, a ± b by transitivity. Group Contraction Lemma: If G is decisive and | G |≥ 2, then there exists G ² G such that G ² is decisive. Proof: Let G = G 1 G 2 , where G 1 and G 2 are nonempty and G 1 G 2 =∅ . By the Field Expansion Lemma it is enough to show that G 1 or G 2 is almost decisive. Take three alternatives a , b , and c and a profile of preference rela- tions ( ± i ) i N satisfying for all i G 1 , c ± i a ± i b , and for all i G 2 , a ± i b ± i c , and for all other i , b ± i c ± i a . If G 1 is not almost decisive, then there are x and y and a profile ( ± ² i ) i N such that
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: x i y for all i G 1 and y i x for all i / G 1 , such that F ( 1 , . . . , n ) determines y to be at least as preferable as x . Therefore, by I , b c . Similarly, if G 2 is not almost decisive, then c a . Thus, by transi-tivity b a , but since G is decisive, a b , a contradiction. Thus, G 1 or G 2 is almost decisive. Proof of the Theorem: By Par , the set N is decisive. By the Group Contraction Lemma, every decisive set that includes more than one member has a proper subset that is decisive. Thus, there is a set { i } that is decisive, namely, F ( 1 , . . . , n ) i ....
View Full Document

Ask a homework question - tutors are online