On The Robustness of Majority Rule

Size: px
Start display at page:

Download "On The Robustness of Majority Rule"

Transcription

1 On The obustness of Majorit ule The Harvard counit has ade this article openl available. Please share how this access benefits ou. Your stor atters. Citation Published Version Accessed Citable Link Ters of se Dasgupta, Partha, and Eric Maskin On The obustness of Majorit ule. Journal of the European Econoic Association 6 (5) (Septeber): doi: /jeea doi: /jeea April 29, :00:21 PM EDT This article was downloaded fro Harvard niversit's DASH repositor, and is ade available under the ters and conditions applicable to Open Access Polic Articles, as set forth at (Article begins on net page)

2 On the obustness of Majorit ule and ule b Consensus Partha Dasgupta * and Eric Maskin ** Januar 1998 Current version: Septeber 2003 Abstract We show that siple ajorit rule satisfies the Pareto propert, anonit, neutralit, and (generic) transitivit on a bigger class of preference doains than an other voting rule. If we replace neutralit in the above list of properties with independence of irrelevant alternatives, then the corresponding conclusion holds for unaniit rule (rule b consensus). * acult of Econoics and Politics, niversit of Cabridge ** School of Social Science, Institute for Advanced Stud and Departent of Econoics, Princeton niversit This research was supported b grants fro the Beijer International Institute of Ecological Econoics and the.s. National Science oundation. We thank Salvador Barberá, rançois Maniquet, and Willia Thoson for helpful coents on an earlier version.

3 1. Introduction A voting rule is a ethod for choosing fro a set of social alternatives on the basis of voters preferences. Man different voting rules have been studied in theor and used in practice. But far and awa the ost popular ethod has been siple ajorit rule, the rule that chooses alternative over alternative if ore people prefer to than vice versa. There are, of course, good reasons for ajorit rule s 1 popularit. It not onl is attractivel straightforward to use in practice, but satisfies soe copelling theoretical properties, aong the the Pareto propert (the principle that if all voters prefer to and is available, then should not be chosen), anonit (the principle that choices should not depend on voters labels), and neutralit (the principle that the choice between a pair if alternatives should depend onl on the pattern of voters preferences over that pair, not on the alternatives labels) 2. But ajorit rule has a well-known flaw, discovered b the Marquis de Condorcet (1785) and illustrated b the Parado of Voting (or Condorcet Parado): it can generate intransitive choices. Specificall, suppose that there are 1 or convenience, we will oit the odifier siple when it is clear that we are referring to siple ajorit rule rather to the an variants, such as the superajorit rules. 2 In fact, Ma (1952) established that ajorit rule is the unique voting rule satisfing the Pareto propert, anonit, and neutralit, and a fourth propert called positive responsiveness if alternative is chosen (perhaps not uniquel) for a given configuration of voters preferences and the onl change that is then ade to those preferences is to ove up in soe voters preference ordering, is now uniquel chosen. Without positive responsiveness, there are an voting rules including all the superajorit rules that satisf the properties. We shall coe back to Ma s characteriation in section 5. 1

4 three voters 1, 2, 3, three alternatives,,, and that voters preferences are as follows: (i.e., voter 1 prefers to to, voter 2 prefers to to, and voter 3 prefers to to ). Then, as Condorcet noted, a two-thirds ajorit prefers to, to, and to, so that ajorit rule fails to select an alternative. Despite the theoretical iportance of the Condorcet Parado, there are iportant cases in which ajorit rule avoids intransitivit. Most faousl, when alternatives can be arranged linearl and each voter s preferences are single-peaked in the sense that his utilit declines onotonicall in both directions fro his favorite alternative, then, following Black (1948), ajorit rule is transitive for (alost) all 3 configurations of voters preferences. Alternativel, suppose that, for ever three alternatives, there is one that no voter ranks in the iddle. This propert, called liited agreeent (see Inada 1969, Sen and Pattanaik 1969), sees to have held in recent rench presidential elections, where the Gaullist and Socialist candidates have not inspired uch passion, but the National ront candidate, Jean-Marie Le Pen, has attracted either revulsion or adiration, i.e., everbod ranks hi either first or last. Whether or not this pattern of preferences has been good for rance is open to debate, but it is certainl good for ajorit rule: liited agreeent, like single-peakedness, ensures transitivit (alost alwas). 3 We clarif what we ean b alost all in section 2. 2

5 So, ajorit rule works well in the sense of satisfing the Pareto propert, anonit, neutralit and generic transitivit for soe doains of voters preferences but not for others. A natural question to ask is how its perforance copares with that of other voting rules. Clearl, no voting rule can work well for all doains; this conclusion follows iediatel fro the Arrow ipossibilit theore 4 (Arrow, 1951). But we ight inquire whether there is a voting rule that works well for a bigger class of doains than does ajorit rule. 5 We show that the answer to this question is no. Specificall, we establish (Theore 1) that if a given voting rule works well on a doain of preferences, then ajorit rule works well on that doain too. Conversel, if differs fro ajorit rule 6, there eists soe other doain on which ajorit rule works well and does not. Thus essentiall ajorit rule is uniquel the voting rule that works well on the ost doains; it is, in this sense, the ost robust voting rule. This propert can be viewed as a characteriation of ajorit rule copleenting the one given b Ma (1952) (for ore on this, see the discussion and corollar following Theore 1). Theore 1 strengthens a result obtained in Maskin (1995). That earlier proposition requires two rather strong auiliar assuptions: 4 Our forulation of neutralit (see section 3) which is, in fact, the standard forulation (see Sen, 1971) incorporates Arrow s independence of irrelevant alternatives, the principle that the choice between two alternatives should depend onl on voters preferences for those two alternatives and not on their preferences for other alternatives. We could instead have decoposed neutralit into two separate properties: (i) setr with respect to alternatives, and (ii) independence of irrelevant alternatives. 5 It is eas to find voting rules that satisf three out of our four properties on all doains of preferences. or eaple, two-thirds ajorit rule (which dees two alternatives as sociall indifferent unless one garners at least a two-thirds ajorit against the other) satisfies Pareto, anonit, and neutralit on an doain. Siilarl, rank-order voting (see below) satisf Pareto, anonit, and generic transitivit on an doain. 6 More precisel, the hpothesis is that differs fro ajorit rule in soe open neighborhood of preference configurations belonging to a doain on which ajorit rule works well. 3

6 The first is that the nuber of voters be odd. This assuption is needed because Maskin (1995) deands transitivit for all preference configurations drawn fro a given doain. And as we will see below, even when preferences are single-peaked, intransitivit is possible if the population splits eactl between two preference orderings; an odd nuber of voters prevents this fro happening. To capture the idea that such a split is unlikel, we will work with a continuu of voters and ask onl for generic transitivit. Second, to prove the second half of the proposition, Maskin (1995) akes the strong assuption that the voting rule being copared with ajorit rule satisfies Pareto, anonit, and neutralit on an doain. We show that this assuption can be dropped. Although treating all alternatives alike as neutralit entails is a natural constraint in an political and econoic settings, it is not alwas a reasonable assuption. or eaple, there are cases in which we a wish to treat the status quo differentl fro other alternatives. or that reason, it is of soe interest to investigate which voting rule works best when neutralit is replaced b the weaker assuption of independence of irrelevant alternatives. Our second ajor finding (Theore 2) establishes that, in this odified scenario (where we also ipose a ild tie-break consistenc requireent), unaniit rule with an order of precedence is uniquel the ost robust voting rule. To define this rule, fi an ordering of the alternatives, interpreted as the order of precedence. Then, between two alternatives, the rule will choose the one earlier in the ordering unless voters unaniousl prefer the other alternative. naniit rule with an order of precedence thus corresponds 4

7 to the sequential protocol that a coittee ight follow were it not willing to replace the status quo with another alternative ecept b consensus. We proceed as follows. In section 2, we set up the odel. In section 3, we define our four properties, Pareto, anonit, neutralit, and generic transitivit forall. We also characterie when rank-order voting a ajor copetitor of ajorit rule satisfies all these properties. In section 4, we establish a lea, closel related to a result of Sen and Pattanaik (1969) that characteries when ajorit rule is genericall transitive. We use this lea in section 5 to establish our ain result on ajorit rule. inall, we prove the corresponding result for unaniit rule in section The Model Our odel is in ost respects a standard social-choice fraework. Let X be the set of social alternatives. or technical convenience, we take X to be finite with cardinalit ( 3). The possibilit of individual indifference often akes technical arguents in the social-choice literature a great deal essier (see for eaple, Sen and Pattanaik, 1969). We shall sipl rule it out b assuing that individual voters preferences are drawn fro a set of strict orderings, where is a subset of set of all logicall possible strict orderings of X. or an ordering X and an X, the alternatives, X, the notation denotes is preferred to in ordering. or eaple, if we can arrange the social alternatives fro least to greatest, i.e., 1 < 2 < <, 7 then consists of single-peaked preferences (relative to this 7 We are using the ters least and greatest figurativel. All we ean is that there is soe linear order of the alternatives, e.g., how the line up on the left-right ideological spectru. 5

8 arrangeent) if, for all, whenever i i + 1 for soe i, then j j + 1 for all j > i, and whenever i+ 1i for soe i, then j+ 1 j for all j < i. or the reason entioned in the introduction (and elaborated on below), we shall suppose that there is a continuu of voters indeed b points in the unit interval [ 0,1 ]. A profile on is a apping :0,1 [ ], where ( i ) is voter i s preference ordering. Hence, profile is a specification of the preferences of all voters. We shall use Lebesgue easure µ as our easure of the sie of voting blocs. Given alternatives and and profile, let Then q (, ) { } (, ) = µ ( ) q i i. is the fraction of the population preferring to in profile. Let C be the set of coplete, binar relations (not necessaril transitive or strict) on X. A voting rule is a apping that, for each profile, assigns a relation ( ) C. () can be interpreted as the social preference relation corresponding to under. More specificall, for an profile and an alternatives, X, the notation ( ) denotes that is sociall weakl preferred to under ( ) if is chosen and is also available, then is chosen too. or eaple, suppose that is siple ajorit rule. Then, ( ) ( ) ( ) if and onl if q, q,.. This eans that 6

9 As another eaple, consider rank-order voting. Given (strict) ordering of X, let ( ) v be if is the top-ranked alternative of, 1 if is second-ranked, and so on. That is, a voter with preference ordering assigns points to her favorite alternative, 1 1 points to her net favorite, etc. Thus, given profile v ( ) ( ) dµ ( i) is, 0 i alternative s rank-order score (the total nuber of points assigned to ) or Borda count. If O is rank-order voting, then 1 1 ( ) ( ) ( ) µ ( ) ( ) ( ) µ ( ) 0 i 0 i O if and onl if v d i v d i. The notation ( ) " " denotes that is not sociall weakl preferred to, given and. Hence, if ( ) and ( ) preferred to under ( ), which we will usuall denote b ( ). And if both ( ) and ( ) denote this b 3. The Properties satisf. ( )., we shall sa that is sociall strictl, we shall sa that is sociall indifferent to and We are interested in four standard properties that one a wish a voting rule to Pareto Propert on : or all on and all, X, if, for all i, ( i), then ( ) and ( ), i.e., 7

10 ( ). In words, the Pareto propert requires that if all voters prefer to, then societ should also (strictl) prefer to. Virtuall all voting rules used in practice satisf this propert. In particular, ajorit rule and rank-order voting satisf it on the unrestricted doain X. Anonit on : Suppose that π :0,1 [ ] [ 0,1] is a easure-preserving perutation of [ 0,1 ] (b easure-preserving we ean that, for all T [ 0,1, ] µ ( T) µ ( π( T) ) = ). If, for all, π π is the profile such that ( i) = π ( i) π ( ) for all i, then ( ) = ( ). In words, anonit sas that social preferences should depend onl on the distribution of voters preferences and not on who has those preferences. Thus if we perute the assignent of voters preferences b π, social preferences should reain the sae. The reason for requiring that π be easure-preserving is to ensure that the fraction of voters preferring to be the sae for π as it is for. Anonit ebodies the principle that everbod s vote should count equall. It is obviousl satisfied on X b both ajorit rule and rank-order voting. Neutralit on : or all profiles and on and all alternatives,, w,, if then ( ) if and onl if ( ) i w i for all i and ( ) if and onl if ( ) w 8

11 ( ) if and onl if ( ). In words, neutralit requires that the social preference between and should depend onl on the proportions of voters preferring and preferring, and not on what the alternatives and actuall are. As noted in the introduction, this (standard) version of neutralit ebodies independence of irrelevant alternatives, the principle that the social preference between and should depend onl on voters preferences between and, and not on preferences entailing an other alternative: Independence of Irrelevant Alternatives (IIA) on : or all profiles and on and all alternatives and, if ( ) if and onl if ( ) i i for all i, then ( ) if and onl if ( ). Clearl, ajorit rule satisfies neutralit on the unrestricted doain X. ankorder voting violates neutralit on X because, as is well known, it violates IIA on that doain. However, it satisfies neutralit on an doain on which quasi-agreeent holds. Quasi-agreeent on : Within each triple {,, } X, there eists an alternative, sa, such that either (a) for all, and ; or (b) for all, and ; or (c) for all, either or. 9

12 In other words, quasi-agreeent holds on doain if, for an triple {,, }, anbod with preference in either agrees, that, sa, is best aong the triple, or that is worst, or that is in the iddle. Lea 1: O satisfies neutralit on if and onl quasi-agreeent holds on. Proof: See appendi. An ordering is transitive if for all,, X, and ipl that. Transitivit deands that if is weakl preferred to and is weakl preferred to, then should be weakl preferred to. Transitivit on : ( ) is transitive for all profiles on. or our results on ajorit rule we will, in fact, not require transitivit for all profiles in but onl for alost all. To otivate this weaker requireent, let us first observe that, as entioned in the introduction, single-peaked preferences do not guarantee that ajorit rule is transitive for all profiles. Specificall, suppose that < < and consider the profile [ 0, 1 ) [ 1,1] 2 2 That is, we are supposing that half the voters (those fro 0 to 1 2 ) prefer to to and that the other half (those fro 1 2 to 1) prefer to to. Note that these preferences are certainl single-peaked relative to the linear arrangeent, < <. However, the social preference relation under ajorit rule for this profile is not transitive: is sociall indifferent to, is sociall strictl preferred to, et is sociall indifferent to. We can denote the relation b: 10

13 . Nevertheless, this intransitivit is a knife-edge phenoenon - - it requires that eactl as an voters prefer to as to, and eactl as an prefer to as prefer to. Thus, there is good reason for us to overlook it as pathological or irregular. And, because we are working with a continuu of voters, there is a foral wa in which we can do so, as follows. Let S be a subset of (0, 1). A profile on is regular with respect to S (which we call an eceptional set) if, for all alternatives and, ( ) q, S. That is, a regular profile is one for which the proportions of voters preferring one alternative to another all fall outside the specified eceptional set. Generic Transitivit on : There eists a finite eceptional set S such that, for all profiles on that are regular with respect to S, ( ) is transitive. In other words, generic transitivit requires onl that social preferences be transitive for regular profiles, ones where the preference proportions do not fall into soe finite eceptional set. or eaple, ajorit rule is genericall transitive on a doain of single-peaked preferences because if the eceptional set consists of the single point 1 2 i.e., S = { 1 2} social preferences are then transitive for all regular profiles. doain In view of the Condorcet parado, ajorit rule is not genericall transitive on X. B contrast, rank-order voting is not onl genericall transitive on full transitive (i.e., genericall transitive with eceptional set S = φ ). X but 11

14 We shall sa that a voting rule works well on a doain if it satisfies the Pareto propert, anonit, neutralit, and generic transitivit on that doain. Thus, in view of our previous discussion, ajorit rule works well on a doain of single-peaked preferences, whereas rank-order voting works well on a doain with quasi-agreeent. 4. Generic Transitivit and Majorit ule We will show below (Theore 1) that ajorit rule works well on or ore doains than (essentiall) an other voting rule. To establish this result, it will be useful to have a characteriation of precisel when ajorit rule works well, which aounts to asking when ajorit rule is genericall transitive. We have alread seen in the previous section that a single-peaked doain ensures generic transitivit. And we noted in the introduction that the sae is true when the doain satisfies liited agreeent. But single-peakedness and liited agreeent are onl sufficient conditions for generic transitivit; what we want is a condition that is both sufficient and necessar. To obtain that condition, note that, for an three alternatives,,, there are si logicall possible strict orderings, which can be sorted into two Condorcet ccles 8 : ccle 1 ccle 2 We shall sa that a doain satisfies the no-condorcet-ccle propert 9 if it contains no Condorcet ccles. That is, for each triple of alternatives at least one ordering is issing 8 We call these Condorcet ccles because the constitute preferences that give rise to the Condorcet parado 9 Sen and Pattanaik (1969) refer to this condition as etreal restriction. 12

15 fro each of ccles 1 and 2 (ore precisel for each triple {,, }, there do not eist orderings {,, } in that, when restricted to {,, }, generate ccle 1 or ccle 2). Lea 2: Majorit rule is genericall transitive on doain if and onl if satisfies the no-condorcet-ccle propert. 10 Proof: If there eisted a Condorcet ccle in, then we could reproduce the Condorcet parado. Hence, the no-condorcet-ccle propert is clearl necessar. To show that it is sufficient, we ust deonstrate, in effect, that the Condorcet parado is the onl thing that can interfere with ajorit rule s generic transitivit. To do this, let us suppose that is not genericall transitive on doain. Then, in particular, if we let S = { 1 2} there ust eist a profile on that is regular with respect to { 1 2 } but for which ( ) ( ) ( ) ( ) is intransitive. That is, there eist,, X such that, with at least one strict preference. But because is regular with respect to { 1 }, ( ) 2 (1) ( ) 1 q >, 2, iplies that that is, over half the voters prefer to. Siilarl, ( ) (2) ( ) 1 q >, 2, iplies that eaning that over half the voters prefer to. Cobining (1) and (2), we conclude that there ust be soe voters in who prefer to to, i.e., (3) or the case of an odd and finite nuber of voters, Sen and Pattanaik (1969) establish that the no- Condorcet-ccle propert is necessar and sufficient for ajorit rule to be transitive. 13

16 B siilar arguent, it follows that,. Hence, contains a Condorcet ccle, as was to be shown. Q.E.D. 5. The obustness of Majorit ule To establish our ain finding about ajorit rule, we need one final concept. { } Given profile and ordering let w( ; ) = i ( i ) =. That is, ( ; ) w is the proportion of voters in profile with ordering. or ε > 0, let the ε -neighborhood of which we will denote b N ε ( ) be the set of profiles whose proportions differ fro those of b less than ε : { ; ; ε for all } ( ) ( ) ( ) N = w w <. ε Theore 1: Suppose that voting rule works well on doain. Then, ajorit rule works well on too. Conversel, suppose that differs fro on soe open neighborhood. More precisel, assue that there eist a profile which works well) and ε > 0 such that (4) ( ) ( ) for all N ε ( ) Then, there eists a doain on which eark: Without the requireent that. (on a doain works well, but does not. on belong to a doain on which ajorit rule works well, the converse assertion above would be false. In particular, consider a voting 11 To be precise, forula (3) sas that there eists an ordering in in which is preferred to and is preferred to. However, because satisfies IIA we can ignore the alternatives other than.,, 14

17 rule that coincides with ajorit ecept for profiles that contain a Condorcet ccle. It is eas to see that such a rule works well on an doain for which ajorit rule does. Proof: Suppose first that works well on. If, contrar to the theore, work well on, then, fro Lea 2, there eists a Condorcet ccle in : does not (5),,. Let S be the eceptional set for on. Because S is finite (b assuption), we can find an integer n such that, if we divide the population into n equal groups, an profile for which all the voters in each particular group have the sae ordering in ust be regular with respect to S. 1 Let 0, n 1 2 be group 1, ( n, n be group 2,, and ( n 1 n,1 be group n. Consider a profile 1 on such that all voters in group 1 prefer to and all voters in the other groups prefer to. That is, the profile is (7) 1 2 n. ro (5), such a profile eists on. ro neutralit (ipling IIA), the social preferences ( 1 ) do not depend on voter s preferences over other alternatives. There are three cases either (i) is sociall strictl preferred to under ( 1 );( ii) is sociall indifferent to under ( ) preferred to under ( 1 ). 1 ; or ( iii) is sociall strictl Case (i): ( 1 ) 15

18 Consider a profile 1 on in which all voters in group 1 prefer to to ; all voters in group prefer to to ; and all voters in the reaining groups prefer to to. That is, 12 (8) 1 = n Notice that, in profile 1, voters in group 1 prefer to and that all other voters prefer to. Hence, neutralit and the case (i) hpothesis ipl that ust be sociall strictl preferred to under ( 1 ), i.e., (9) ( 1 ) Observe also that, in 1, voters in group 2 prefer to and all other voters prefer to. Hence fro anonit and neutralit and the case (i) hpothesis, we conclude that ust be sociall strictl preferred to under ( 1 ), i.e., (10) ( 1 ). Now (9), (10), and generic transitivit ipl that is sociall strictl preferred to under ( 1 ), i.e., (11) ( 1 ) 12 This is not quite right because we are not specifing how voters rank alternatives other than,, and. But fro IIA, these other alternatives do not atter. 16

19 But (8), (11), and neutralit ipl for an profile such that n, ust be sociall strictl preferred to. Hence, fro neutralit, for an profile 2 on such that (12) n, ust be sociall strictl preferred to, i.e., (13) ( 2 ) That is, we have shown that if is sociall strictl preferred to when just one out of n groups prefers to (as in (7)), then is again sociall strictl preferred to when two groups out of n prefer to (as in (12)). Now choose 2 on so that n (14) 2 =. Arguing as above, we can use (12) (14) to show that is sociall strictl preferred to if three groups out of n prefer to. Continuing iterativel, we conclude that is sociall preferred to even if n 1 groups out of n prefer to, which, in view of neutralit, violates the case (i) hpothesis. Hence case (i) is ipossible. Case (ii): ( 1 ) 17

20 But fro the case (i) arguent, case (ii) leads to the sae contradiction as before. Hence we are left with Case (iii): ( 1 ) Consider a profile ˆ on such that ˆ 1 n 1 n =. ro anonit, neutralit and the case (iii) hpothesis, we conclude that is sociall indifferent to and is sociall indifferent to under ( ˆ ), i.e., (15) ( ˆ ). and (16) ( ˆ ) But the Pareto propert iplies that is sociall strictl preferred to under ( ˆ ), which together with (15) and (16) contradicts generic transitivit. We conclude that case (iii) is ipossible too, and so. ust work well on after all, as claied. Turning to the converse, suppose that there eist doain and ε > 0 such that works well on, profile on and (4) holds. ro (4), we can partition, voters into n equal group and assign everone within a group the sae ordering in such a wa that the resulting profile on is regular and ( ) ( ). urtherore, because is assued to work well on, we can assue that does too (otherwise, 18

21 we can take = ). Hence, fro neutralit of, we can assue that consists of just two orderings and. More forall, there eist integers n and k with (17) n k> k, alternatives, X and orderings, with (18) and such that if we take (19) 1 k k+ 1 n =, then is weakl sociall preferred to under ( ) (20) ( ) Notice that ( ) ( ).., i.e., To give the idea of the proof, let us assue for the tie being that satisfies the Pareto propert, anonit, and neutralit on the unrestricted doain X. Consider {, } and profile such that (21) 1 k k+ 1 n k n k+ 1 n =. 13 Then fro (18)-(21), anonit, and neutralit, we have (22) ( ) ( ) and. ro the Pareto propert, we have 13 We have again left out the alternatives other than,,, which we are entitled to do b IIA. To ake atters siple, assue that the orderings of are all the sae for these other alternatives. Suppose,,. furtherore that, in these orderings,,,, are each preferred to an alternative not in { } 19

22 (23) ( ). But, b construction, is regular with respect to s eceptional set. Thus, (22) and (23) together ipl that violates generic transitivit on =,,. Yet, fro Lea 2 (see also footnote 11), is a doain on which is genericall transitive on, which iplies that works well but does not. Thus, we are done in the case in which alwas satisfies the Pareto propert, anonit and neutralit. However, if does not alwas satisf these properties, then we can no longer infer (22) fro (18)-(21), and so ust argue less directl (although we shall still ake use of the sae basic idea). Consider and of (18). Suppose first that there eists alternative X such that (24) and. Let w be the alternative iediatel below in ordering. If w, let be the strict ordering that is identical to ecept that w and are now interchanged (so that w ). B construction of, the doain {,, } ccle, and so, fro Lea 2, does not contain a Condorcet works well on this doain. Hence, we can assue that works well on this doain too (otherwise, we are done). Notice that neutralit of and (20) then ipl that if we replace b in profile ust have (25) ( ). (to obtain profile ) we 20

23 Now, if w is the alternative iediatel below in and w, we can perfor the sae sort of interchange as above to obtain work well on {,, } and that (26) ( ). and and so conclude that and B such a succession of interchanges, we can, in effect, ove downward while still ensuring that and work well on the corresponding doains and that the counterparts to (20), (25) and (26) holds. The process coes to end, however, once the alternative iediatel below in (or,, etc.) is. urtherore, this ust happen after finitel an interchanges (since X is finite). Hence, we can assue without loss of generalit that w = (i.e., that is iediatel below in ). Let be the strict ordering that is identical to ecept that and (which we are assuing are adjacent in ) are now interchanged. ro the above arguent, { } works well on =,, and we can suppose that does too. Hence, fro the sae arguent we used for above, we can conclude that (27) ( ) and ( ) and (28) ( ), where is the profile 1 k k+ 1 n k n k+ 1 n. 21

24 But (27) and (28) generate the sae contradiction we obtained following (23). Thus, we are done in the case where (24) holds. Net, suppose that there eists X such that (29) and. But this case is the irror iage of the case where (24) holds. That is, just as in the previous case we generated with (30) through a finite succession of interchanges in which oves downwards in, so we can now generate satisfing (30) through a finite succession of interchanges in which oves upwards in. If we then take {,, } as when (24) holds, that, we can show that and where =, we can furtherore conclude, and work well on. But, paralleling the arguent for ( ) and ( ) ( ), is the profile ipling that ( ) on, and so again we are done. 1 k k+ 1 n k n k+ 1 n, is intransitive. This contradicts the conclusion that works well inall, suppose that there eists X 22

25 such that (31) and. As in the preceding case, we ove upwards in through a succession of interchanges. Onl this tie, the process when and are interchanged to generate ˆ such that (32) ˆ ˆ. As in the previous cases, we can conclude that and work well on {,, ˆ }. Take ˆ such that Then, as in the arguents about ˆ 1 k k + 1 n k n k + 1 n =. ˆ ˆ and, we infer that ( ˆ ) is intransitive, a contradiction of the conclusion that works well on {,, ˆ }. This copletes the proof when (31) holds. The reaining possible cases involving are all repetitions of one or another of the cases alread treated. Q.E.D. We have alread entioned Ma s (1952) characteriation of ajorit rule (see footnote 2). In view of Theore 1, we can provide an alternative characteriation. Specificall, call two voting rules and genericall the sae on doain if the set of profiles on for which ( ) = ( ) is open and dense (put another wa, we are requiring that if ( ) ( ) ( ) ( ) for all ε ( ) then there should not eist ε > 0, such that N ). Call aiall robust if there eists no voting 23

26 rule that (i) works well on ever doain on which works well and (ii) works well on soe doain on which does not work well. Theore 1 iplies: Corollar: An aiall robust voting rule is genericall the sae as ajorit rule. 6. naniit ule The setr inherent in neutralit is often a reasonable and desirable propert-- we would presuabl want to treat all candidates in a presidential election the sae. However, there are also an circustances in which it is natural to favor certain alternatives. The rules for changing the.s. Constitution are a case in point. The have been deliberatel devised so that, at an tie, the current version of the Constitution the status quo is difficult to revise. Accordingl, let us rela neutralit and just ipose IIA. We will require the following additional weak condition on voting rules: Tie-break Consistenc: Given voting rule, there eists an ordering, X and all on for which q (, ) = q (, ) ( ) if and onl if., we have such that, for all Tie-break consistenc requires that in situations where the population splits between two alternatives, the tie be broken (or not broken as the case a be) consistentl in the sense that it be done transitivel (note that, given IIA, the onl aspect of the condition that is restrictive is the stipulation that be an ordering which entails transitivit). That is, if is chosen over when the population splits between and, and is chosen over when the population splits between and, then should be chosen over when the population splits between and. Observe that because the 24

27 likelihood that the population will split eactl is ver low, tie-break consistenc is not a terribl deanding condition. Let be a strict ordering of X. We shall denote unaniit rule with order of precedence b and define it so that, for all profiles and all alternatives and, ( ) if and onl if either ( i) for all i [ 0,1] ( ) and ( ) or else there eist j such that j. That is, between and, the alternative earlier in the order of precedence will be chosen unless voters unaniousl prefer the other alternative. can be ipleented b the following procedure. Begin with alternative 1 as the status quo (where 1 2 ). At each stage (there are 1 in all), copare the current status quo with the net alternative in the order. If everone prefers this net alternative, then it becoes the new status quo; otherwise, the old status quo reains in place. We shall sa that a voting rule works satisfactoril on a doain if it satisfies the Pareto propert, anonit, IIA, and transitivit on. 14 Just as Leas 1 and 2 characterie when rank-order voting and ajorit rule work well, Lea 3 tells us when unaniit rule with an order of precedence works satisfactoril: Lea 3: naniit rule with order of precedence works satisfactoril on doain if and onl if, for all triples {,, } with 14 There is an obvious sense in which to work satisfactoril is a less deanding requireent than to work well, since the forer iposes onl IIA rather than the stronger condition, neutralit. Note, however, that working satisfactoril requires eact transitivit, whereas working well onl generic transitivit. 25

28 (33), there do not eist both and in such that (34). Proof: Suppose that, for soe triple {,, } satisfing (33), there eist and in satisfing (34). Consider profile ˆ such that ˆ = [ 0, 1 ) [ 1,1] 2 2. Because and voters fro 1 2 to 1 prefer to, we have (35) ( ˆ ). Siilarl, we have (36) ( ˆ ). But because everone prefers to, we have ( ˆ ), 26

29 which together with (35) and (36) contradicts transitivit. We conclude that if (34) holds, then a necessar condition for issing fro. to work satisfactoril on is that either or be Conversel, suppose that does not work satisfactoril on. Because this voting rule alwas satisfies Pareto, anonit, and IIA, there ust eist {,, } satisfing (33) and a profile (37) or such that either ( ) (38) ( ). Suppose first that (38) holds. Then, fro (33), we ust have ( ) ( ) for all [ 0,1] i i i, which contradicts the hpothesis that ( ) b assuption,, we infer that (39) ( i) for all i [ 0,1] Because ( ) and ( ).. Hence, (37) ust hold. Then because,, there ust eist i and i such that (40) ( ) and ( ) But (39) and (40) ipl: i i. 27

30 ( i ) ( i ) and Hence, when (37) holds, that not both and belong to is also a sufficient condition for to work satisfactoril on. Q.E.D. We can now establish our second ajor result: Theore 2: Suppose that satisfies tie-break consistenc. There eists a strict ordering such that for all doains on which works satisfactoril, works satisfactoril on too. urtherore, if there eist a doain on which works satisfactoril and profile on such that ( ) ( ), then there eists a doain on which works satisfactoril but does not. Proof: Given voting rule, let be the corresponding tie-break ordering prescribed b tie-break consistenc. Choose a strict ordering consistent with strict ordering such that, for all, X (41) if then Consider {,, } with., i.e., let be a (42) and suppose that works satisfactoril on doain. ro Lea 3, works satisfactoril on provided that whenever and are two strict orderings such that 28

31 (43) and, then not both and can belong to. Thus, to establish the first assertion of the Theore, it suffices to show that if (43) holds, either and ust be issing fro. Suppose to the contrar that,. Consider the profile ˆ on such that (44) ˆ = [ 0, 1 2) [ 1 2,1] ro (41) and (42) we have (45) (although the rankings in (45) a not be strict). Hence, fro (44) and (45), tie-break consistenc iplies that (46) ( ˆ) ( ˆ). But because everone in ˆ prefers to, the Pareto propert gives us ( ˆ ), which, together with (46), eans that ( ˆ ) is not transitive, a contradiction. Thus the first assertion of the theore is indeed established. To prove the converse, consider profile and doain (47) is on such that (48) works satisfactoril on 29

32 and (49) ( ) ( ). If there are ultiple such and choose a pair (, ) and alternatives, to solve (50) a q (, ) subject to (47) - (49) and (51) ( ) and ( ) ro (51), we have (52).. Let be the opposite of, i.e., for all, if and onl if. Let be the alternative just below in ordering (if is the lowest alternative in, the arguent is ver siilar). Let be the ordering that coincides with ecept that and are interchanged. inall, let ˆ be the ordering that coincides with ecept that and are interchanged. It is a atter of straightforward verification to check that, for all {,, ˆ } and all,, if, then we have neither 30

33 (53) nor (54), which, fro Lea 3, iplies that is transitive on {,, } =. We know, fro (41) and (52), that. There are two cases. Case I: Because, (41) iplies that (55). Consider the profile ro (55), we have = 1 1 [ ) [ ] 1 0, 2 2,1 1 (56) ( ). ro the Pareto propert, we have 1 ( ). inall, fro the Case I hpothesis, we have (57) ( 1 ). 31

34 1 But cobining (55) (57) we conclude that ( ) is intransitive, and so, if Case I holds, we can take = to coplete the proof. Case II: ecall fro our choice of that ( ) and ( ) Thus, in view of (52) and the Case II hpothesis, we cannot have 1 (, ) = (, ) = q q. We ust therefore have either (58) q (, ) > q (, ) or (59) q (, ) < q (, ) 2. rank and differentl. Suppose first that (58) holds. Because works satisfactoril on, we can assue that does too (otherwise, we can take = and we are done). Hence, if is a profile on such that (60) q (, ) = q (, ), anonit and neutralit of ipl that (61) ( ). Let be the ordering that coincides with ecept that interchanged. One can verif echanicall that for all {,, ˆ, },,, if and are and all 32

35 then we do not have (62). Hence, fro Lea 3, works satisfactoril on ˆ {,,, ˆ, } =, and so we can assue that the sae is true of. Hence, if is a profile on ˆ satisfing (60), we can infer (61). Consider 2 = 2 such that Because q 2 (, ) = q (, ) 2 (63) ( ) ro the Pareto propert 1 1 [ 0, ) 2 q ( 2 )) ( ) q,,,,1., the above arguent iplies that (64) 2 ( ). urtherore, because 2 (, ) 2 (65) ( ) 1 q = 2, (41) and the fact that ipl that. 2 But (63) (65) contradict the transitivit of ( ) (58) holds., and so we can take = ˆ when 33

36 1 inall, assue that (59) holds. If there eists β < 2 and a profile on ˆ such that q = β (66) (, ) and (67) ( ), consider profile 3 such that ( )) ( ) ( ) β ) ( ) 0,,,,,,,1 3 q q q q β + + = ˆ Because 3 (, ) that q = β, (66) and (67) ipl 3 (68) ( ). Because q 3 (, ) = q (, ) 3 (69) ( ). Now, 3 (, ) (, ) fact that, we have q = q + β and so fro the choices of,, and and the 3 ( ), we ust have (70) 3 ( ). 3 But (68) (70) contradict the transitivit of ( ). 34

37 1 Thus assue that, for all β < 2 and profiles on ˆ q = β (71) (, ) we have (72) ( ) 1 If there eists ( 0, ),. (73) (, ) and 2 with δ and profile on ˆ such that q δ = (74) ( ) then consider profile ro the Pareto propert,, 4 such that [ δ) [ δ ] 4 0,,1 =. (75) 4 ( ) ro (71) and (72), we have 4 (76) ( ). ro (73) and (74), we have (77) ( ) 4. 4 But (75) (77) contradict the transitivit of ( ). So we conclude that, for all 1 ( 0, ) δ, if on ˆ satisfies (73), then 2 35

38 (78) ( ) inall, consider profile. 5 such that ( )) ( ) 0, q, q,,1 5 =. ro the Pareto propert, we have (79) 5 ( ). Because q 5 (, ) = q (, ) 5 (80) ( ) inall, because 5 (, ) q <. 1 2, we have, (73) and (75) ipl (81) 5 ( ). 5 Now, (79) (81) contradict the transitivit of ( ), and so we can take = ˆ. Q.E.D. 36

39 eferences Arrow, K.J. (1951), Social Choice and Individual Values (New York; John Wile). Second ed., Black, D. (1948), On the ationale of Group Decision-aking, Journal of Political Econo, 56(1), Inada, Ken-ichi (1969), On the Siple Majorit ule Decision, Econoetrica, 37(3), Maskin, E. (1995), Majorit ule, Social Welfare unctions, and Gae ors, in K. Basu, P.K. Pattanaik and K. Suuura, eds., Choice, Welfare and Developent (Oford: Clarendon Press). Ma, K. (1952), Set of Necessar and Sufficient Conditions for Siple Majorit Decisions, Econoetrica, 20 (4), Sen, A. (1970), Collective Choice and Social Welfare, (San rancisco: Holden Da). Sen, A. and P. Pattanaik (1969), Necessar and Sufficient Conditions for ational Choice under Majorit Decision, Journal of Econoic Theor, 1(2),

On the Robustness of Majority Rule

On the Robustness of Majority Rule On the Robustness of Majorit Rule Partha Dasgupta * and Eric Maskin ** Januar 1998 Current version: March 2004 Abstract We show that siple ajorit rule satisfies four standard and attractive properties

More information

Cosine similarity and the Borda rule

Cosine similarity and the Borda rule Cosine siilarity and the Borda rule Yoko Kawada Abstract Cosine siilarity is a coonly used siilarity easure in coputer science. We propose a voting rule based on cosine siilarity, naely, the cosine siilarity

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

Elections and Strategic Voting: Condorcet and Borda. P. Dasgupta E. Maskin

Elections and Strategic Voting: Condorcet and Borda. P. Dasgupta E. Maskin Elections and Strategic Voting: ondorcet and Borda P. Dasgupta E. Maskin voting rule (social choice function) method for choosing social alternative (candidate) on basis of voters preferences (rankings,

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Fairness, Risk Preferences and Independence: Impossibility Theorems

Fairness, Risk Preferences and Independence: Impossibility Theorems Fairness, Risk Preferences and Independence: Ipossibilit Theores Drew Fudenberg* and David K. Levine** First Version: April 30, 2010 This Version: March 9, 2011 Abstract: The ost widel used econoic odels

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

Málaga Economic Theory Research Center Working Papers

Málaga Economic Theory Research Center Working Papers Málaga Econoic Theory Research Center Working Papers Unequivocal Majority and Maskin-Monotonicity Pablo Aorós WP 2008-3 March 2008 Departaento de Teoría e Historia Econóica Facultad de Ciencias Econóicas

More information

MULTIPLAYER ROCK-PAPER-SCISSORS

MULTIPLAYER ROCK-PAPER-SCISSORS MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

Simple Expressions for Success Run Distributions in Bernoulli Trials

Simple Expressions for Success Run Distributions in Bernoulli Trials Siple Epressions for Success Run Distributions in Bernoulli Trials Marco Muselli Istituto per i Circuiti Elettronici Consiglio Nazionale delle Ricerche via De Marini, 6-16149 Genova, Ital Eail: uselli@ice.ge.cnr.it

More information

5.2. Example: Landau levels and quantum Hall effect

5.2. Example: Landau levels and quantum Hall effect 68 Phs460.nb i ħ (-i ħ -q A') -q φ' ψ' = + V(r) ψ' (5.49) t i.e., using the new gauge, the Schrodinger equation takes eactl the sae for (i.e. the phsics law reains the sae). 5.. Eaple: Lau levels quantu

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

Linguistic majorities with difference in support

Linguistic majorities with difference in support Linguistic ajorities with difference in support Patrizia Pérez-Asurendi a, Francisco Chiclana b,c, a PRESAD Research Group, SEED Research Group, IMUVA, Universidad de Valladolid, Valladolid, Spain b Centre

More information

Problem Set 2 Due Sept, 21

Problem Set 2 Due Sept, 21 EE6: Rando Processes in Sstes Lecturer: Jean C. Walrand Proble Set Due Sept, Fall 6 GSI: Assane Guee This proble set essentiall reviews notions of conditional epectation, conditional distribution, and

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

On Certain C-Test Words for Free Groups

On Certain C-Test Words for Free Groups Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of

More information

Chapter 6: Economic Inequality

Chapter 6: Economic Inequality Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested

More information

A Fair Solution to the Compensation Problem

A Fair Solution to the Compensation Problem A Fair Solution to the Copensation Proble G. Valletta Discussion Paper 2007-38 Départeent des Sciences Éconoiques de l'université catholique de Louvain CORE DISCUSSION PAPER 2007/77 A FAIR SOLUTION TO

More information

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which

More information

8. BOOLEAN ALGEBRAS x x

8. BOOLEAN ALGEBRAS x x 8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical

More information

8.1 Force Laws Hooke s Law

8.1 Force Laws Hooke s Law 8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax: A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,

More information

Non-Manipulable Domains for the Borda Count

Non-Manipulable Domains for the Borda Count Non-Manipulable Domains for the Borda Count Martin Barbie, Clemens Puppe * Department of Economics, University of Karlsruhe D 76128 Karlsruhe, Germany and Attila Tasnádi ** Department of Mathematics, Budapest

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

2.5 CONTINUITY. a x. Notice that Definition l implicitly requires three things if f is continuous at a:

2.5 CONTINUITY. a x. Notice that Definition l implicitly requires three things if f is continuous at a: SECTION.5 CONTINUITY 9.5 CONTINUITY We noticed in Section.3 that the it of a function as approaches a can often be found simpl b calculating the value of the function at a. Functions with this propert

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version Made available by Hasselt University Library in Docuent Server@UHasselt Reference (Published version): EGGHE, Leo; Bornann,

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

What is Probability? (again)

What is Probability? (again) INRODUCTION TO ROBBILITY Basic Concepts and Definitions n experient is any process that generates well-defined outcoes. Experient: Record an age Experient: Toss a die Experient: Record an opinion yes,

More information

PhysicsAndMathsTutor.com

PhysicsAndMathsTutor.com . A raindrop falls vertically under gravity through a cloud. In a odel of the otion the raindrop is assued to be spherical at all ties and the cloud is assued to consist of stationary water particles.

More information

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for

More information

Strategy-Proofness on the Condorcet Domain

Strategy-Proofness on the Condorcet Domain College of William and Mary W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2008 Strategy-Proofness on the Condorcet Domain Lauren Nicole Merrill College of William

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65 The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,

More information

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit

More information

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition

More information

Documents de travail Working Papers

Documents de travail Working Papers GROUPE D ANALYSE ET DE THÉORIE ÉCONOMIQUE LYON - ST ÉTIENNE WP 1402 Consistent collective decisions under ajorities based on differences Mostapha Diss, Patrizia Pérez- Asurendi January 2014 Docuents de

More information

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13 CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture

More information

27 Oscillations: Introduction, Mass on a Spring

27 Oscillations: Introduction, Mass on a Spring Chapter 7 Oscillations: Introduction, Mass on a Spring 7 Oscillations: Introduction, Mass on a Spring If a siple haronic oscillation proble does not involve the tie, you should probably be using conservation

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Some Classical Ergodic Theorems

Some Classical Ergodic Theorems Soe Classical Ergodic Theores Matt Rosenzweig Contents Classical Ergodic Theores. Mean Ergodic Theores........................................2 Maxial Ergodic Theore.....................................

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

Handout 6 Solutions to Problems from Homework 2

Handout 6 Solutions to Problems from Homework 2 CS 85/185 Fall 2003 Lower Bounds Handout 6 Solutions to Probles fro Hoewor 2 Ait Charabarti Couter Science Dartouth College Solution to Proble 1 1.2: Let f n stand for A 111 n. To decide the roerty f 3

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

I. Understand get a conceptual grasp of the problem

I. Understand get a conceptual grasp of the problem MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departent o Physics Physics 81T Fall Ter 4 Class Proble 1: Solution Proble 1 A car is driving at a constant but unknown velocity,, on a straightaway A otorcycle is

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Answers to Econ 210A Midterm, October A. The function f is homogeneous of degree 1/2. To see this, note that for all t > 0 and all (x 1, x 2 )

Answers to Econ 210A Midterm, October A. The function f is homogeneous of degree 1/2. To see this, note that for all t > 0 and all (x 1, x 2 ) Question. Answers to Econ 20A Midter, October 200 f(x, x 2 ) = ax {x, x 2 } A. The function f is hoogeneous of degree /2. To see this, note that for all t > 0 and all (x, x 2 ) f(tx, x 2 ) = ax {tx, tx

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES #A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta 1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013). A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with

More information

Equilibria on the Day-Ahead Electricity Market

Equilibria on the Day-Ahead Electricity Market Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,

More information

Sampling How Big a Sample?

Sampling How Big a Sample? C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain

More information

Beyond Mere Convergence

Beyond Mere Convergence Beyond Mere Convergence Jaes A. Sellers Departent of Matheatics The Pennsylvania State University 07 Whitore Laboratory University Park, PA 680 sellers@ath.psu.edu February 5, 00 REVISED Abstract In this

More information

The full procedure for drawing a free-body diagram which isolates a body or system consists of the following steps. 8 Chapter 3 Equilibrium

The full procedure for drawing a free-body diagram which isolates a body or system consists of the following steps. 8 Chapter 3 Equilibrium 8 Chapter 3 Equilibriu all effect on a rigid bod as forces of equal agnitude and direction applied b direct eternal contact. Eaple 9 illustrates the action of a linear elastic spring and of a nonlinear

More information

FIRST- AND SECOND-ORDER IVPS The problem given in (1) is also called an nth-order initial-value problem. For example, Solve: Solve:

FIRST- AND SECOND-ORDER IVPS The problem given in (1) is also called an nth-order initial-value problem. For example, Solve: Solve: .2 INITIAL-VALUE PROBLEMS 3.2 INITIAL-VALUE PROBLEMS REVIEW MATERIAL Normal form of a DE Solution of a DE Famil of solutions INTRODUCTION We are often interested in problems in which we seek a solution

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Part B: Many-Particle Angular Momentum Operators.

Part B: Many-Particle Angular Momentum Operators. Part B: Man-Partice Anguar Moentu Operators. The coutation reations deterine the properties of the anguar oentu and spin operators. The are copete anaogous: L, L = i L, etc. L = L ± il ± L = L L L L =

More information

Nontransitive Dice and Arrow s Theorem

Nontransitive Dice and Arrow s Theorem Nontransitive Dice and Arrow s Theorem Undergraduates: Arthur Vartanyan, Jueyi Liu, Satvik Agarwal, Dorothy Truong Graduate Mentor: Lucas Van Meter Project Mentor: Jonah Ostroff 3 Chapter 1 Dice proofs

More information

Midterm 1 Sample Solution

Midterm 1 Sample Solution Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA, Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

On the Existence of Pure Nash Equilibria in Weighted Congestion Games

On the Existence of Pure Nash Equilibria in Weighted Congestion Games MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

On Process Complexity

On Process Complexity On Process Coplexity Ada R. Day School of Matheatics, Statistics and Coputer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand, Eail: ada.day@cs.vuw.ac.nz Abstract Process

More information

Physics 18 Spring 2011 Homework 3 - Solutions Wednesday February 2, 2011

Physics 18 Spring 2011 Homework 3 - Solutions Wednesday February 2, 2011 Phsics 18 Spring 2011 Hoework 3 - s Wednesda Februar 2, 2011 Make sure our nae is on our hoework, and please bo our final answer. Because we will be giving partial credit, be sure to attept all the probles,

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

Week 3 September 5-7.

Week 3 September 5-7. MA322 Weekl topics and quiz preparations Week 3 September 5-7. Topics These are alread partl covered in lectures. We collect the details for convenience.. Solutions of homogeneous equations AX =. 2. Using

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

Estimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples

Estimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked

More information

Section 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y

Section 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y Paul J. Bruillard MATH 0.970 Problem Set 6 An Introduction to Abstract Mathematics R. Bond and W. Keane Section 3.1: 3b,c,e,i, 4bd, 6, 9, 15, 16, 18c,e, 19a, 0, 1b Section 3.: 1f,i, e, 6, 1e,f,h, 13e,

More information

acceleration of 2.4 m/s. (b) Now, we have two rubber bands (force 2F) pulling two glued objects (mass 2m). Using F ma, 2.0 furlongs x 2.0 s 2 4.

acceleration of 2.4 m/s. (b) Now, we have two rubber bands (force 2F) pulling two glued objects (mass 2m). Using F ma, 2.0 furlongs x 2.0 s 2 4. 5.. 5.6. Model: An object s acceleration is linearl proportional to the net force. Solve: (a) One rubber band produces a force F, two rubber bands produce a force F, and so on. Because F a and two rubber

More information

MA Game Theory 2005, LSE

MA Game Theory 2005, LSE MA. Game Theor, LSE Problem Set The problems in our third and final homework will serve two purposes. First, the will give ou practice in studing games with incomplete information. Second (unless indicated

More information

SUR LE CALCUL DES PROBABILITÉS

SUR LE CALCUL DES PROBABILITÉS MÉMOIRE SUR LE CALCUL DES PROBABILITÉS M. le MARQUIS DE CONDORCET Histoire de l Acadéie des Sciences des Paris, 783 Parts 4 & 5, pp. 539559 FOURTH PART Reflections on the ethod to deterine the Probability

More information

Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives

Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives Sean Horan, Martin J. Osborne, and M. Remzi Sanver December 24, 2018 Abstract May

More information

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Algebraic Montgomery-Yang problem: the log del Pezzo surface case c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang

More information

Lecture 21 Principle of Inclusion and Exclusion

Lecture 21 Principle of Inclusion and Exclusion Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students

More information

Weighted Approval Voting

Weighted Approval Voting Weighted Approval Voting Jordi Massó and Marc Vorsat September 4, 2006 Abstract To allow societ to treat unequal alternatives distinctl we propose a natural etension of Approval Voting [7] b relaing the

More information

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are, Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations

More information

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation Todd Davies Symbolic Systems Program Stanford University joint work with Raja Shah, Renee Trochet, and Katarina Ling Decision

More information

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it

More information

Hamiltonicity and Fault Tolerance

Hamiltonicity and Fault Tolerance Hamiltonicit and Fault Tolerance in the k-ar n-cube B Clifford R. Haithcock Portland State Universit Department of Mathematics and Statistics 006 In partial fulfillment of the requirements of the degree

More information

Poly-Bernoulli Numbers and Eulerian Numbers

Poly-Bernoulli Numbers and Eulerian Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441

More information

Numerical solution of Boundary Value Problems by Piecewise Analysis Method

Numerical solution of Boundary Value Problems by Piecewise Analysis Method ISSN 4-86 (Paper) ISSN 5-9 (Online) Vol., No.4, Nuerical solution of Boundar Value Probles b Piecewise Analsis Method + O. A. TAIWO; A.O ADEWUMI and R. A. RAJI * Departent of Matheatics, Universit of Ilorin,

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

Celal S. Konor Release 1.1 (identical to 1.0) 3/21/08. 1-Hybrid isentropic-sigma vertical coordinate and governing equations in the free atmosphere

Celal S. Konor Release 1.1 (identical to 1.0) 3/21/08. 1-Hybrid isentropic-sigma vertical coordinate and governing equations in the free atmosphere Celal S. Konor Release. (identical to.0) 3/2/08 -Hybrid isentropic-siga vertical coordinate governing equations in the free atosphere This section describes the equations in the free atosphere of the odel.

More information