Common Voting Rules as Maximum Likelihood Estimators
|
|
- Christal McCormick
- 6 years ago
- Views:
Transcription
1 Common Voting Rules s Mximum Likelihoo Estimtors Vinent Conitzer Computer Siene Deprtment Crnegie Mellon University 5000 Fores Avenue Pittsurgh, PA 1513 onitzer@s.mu.eu Astrt Voting is very generl metho of preferene ggregtion. A voting rule tkes s input every voter s vote (typilly, rnking of the lterntives), n proues s output either just the winning lterntive or rnking of the lterntives. One potentil view of voting is the following. There exists orret outome (winner/rnking), n eh voter s vote orrespons to noisy pereption of this orret outome. If we re given the noise moel, then for ny vetor of votes, we n ompute the mximum likelihoo estimte of the orret outome. This mximum likelihoo estimte onstitutes voting rule. In this pper, we sk the following question: For whih ommon voting rules oes there exist noise moel suh tht the rule is the mximum likelihoo estimte for tht noise moel? We require tht the votes re rwn inepenently given the orret outome (we show tht without this restrition, ll voting rules hve the property). We stuy the question oth for the se where outomes re winners n for the se where outomes re rnkings. In either se, only some of the ommon voting rules hve the property. Moreover, the sets of rules tht stisfy the property re inomprle etween the two ses (stisfying the property in the one se oes not imply stisfying it in the other se). 1 Introution Voting is very generl metho for ggregting multiple gents preferenes over set of lterntives, This mteril is se upon work supporte y the Ntionl Siene Fountion uner ITR grnts IIS n IIS-07858, n Slon Fellowship. Tuoms Snholm Computer Siene Deprtment Crnegie Mellon University 5000 Fores Avenue Pittsurgh, PA 1513 snholm@s.mu.eu suh s potentil presients, joint plns, llotions of goos or resoures, et.. As suh, it is topi of signifint n growing interest in the AI ommunity with pplitions in ollortive filtering [13], plnning mong utomte gents [10, 11], etermining the importne of we pges [1], to nme few. Reent AI reserh hs stuie the omplexity of exeuting voting rules [7], the omplexity of mnipulting eletions [3,, 5], s well s effiient eliittion of the voters preferenes [, 6]. In this pper, we stuy how voting n e interprete s mximum likelihoo estimtion prolem. We elieve this will she new light on, n enhne the ppliility of, oth voting n mximum likelihoo tehniques. To see how voting my e interprete s mximum likelihoo prolem, let us first ontrst the following two views of voting: 1. The voters preferenes over nites re iiosynrti, n there is no sense in trying to moel where they me from. The purpose of voting is solely to fin ompromise nite tht mximizes the omine welfre of the gents, either expliitly or implitly tring off gents utilities ginst eh other.. There is some solute sense in whih some nites re etter thn others, whih is prior to n not epenent on the gents preferenes. Rther, the gents preferenes re merely their noisy estimtes of this solute qulity. The purpose of voting is to infer the nites solute gooness se on the gents noisy signls, i.e., their votes. For the purposes of this pper, we will e onerne with the seon interprettion (whih is espeilly sensile in ontexts suh s oument seletion). It is instrutive to visulize this interprettion s the simple Byesin network given elow. In this network, the oserve vrile is the gents votes, n we seek to estimte the orret outome. The most nturl wy of oing so is to tke the mximum likelihoo estimte of
2 "orret" outome gents votes the orret outome. 1 Whih outome is hosen s the mximum likelihoo estimte (MLE) epens on the onitionl proility tle for the gents votes noe tht is, it epens on the noise moel. Eh noise moel genertes mximum likelihoo estimtor funtion from gents votes to outomes, n this funtion onstitutes voting rule. The si ie of using n MLE pproh to voting ws introue s erly s the 18th entury, y Conoret [8]. Conoret stuie prtiulr noise moel in whih voter rnke two nites orretly with some given proility p>1/. Conoret solve the ses of n 3 nites. The solution for ritrry numers of nites ws given two enturies lter y Young [15]: he showe tht it oinie with voting rule propose y Kemeny [1]. A slightly extene moel where p is llowe to inrese with the istne etween two lterntives in the orret rnking of lterntives, n the rules tht this proues, hs lso een stuie [9]. However, none of these rules orrespon to ny of the ommonly use voting rules. Shoul the ft tht we o not know how to interpret the ommon voting rules s mximum likelihoo estimtors e viewe s ritiism of the ommon voting rules? This is perhps somewht unfir, euse we my simply not yet hve stuie the right noise moels to generte these rules. Nevertheless, there is no gurntee tht suh noise moels exist. Moreover, it is useful to tully know noise moel for rule: it inreses our unerstning of the rule, it llows us to question the ssumptions in the noise moel (n therefore in the rule), n, where we isgree with these ssumptions, we n moify the noise moel to otin rule tht is more pproprite for our nees. In this pper, we ress these issues y turning the tritionl pproh on its he, y sking: For whih ommon voting rules oes there exist noise moel suh tht the rule is the mximum likelihoo rule for tht istriution? Perhps surprisingly, if we ssume 1 A Byesin (mximum posteriori) interprettion is, of ourse, lso possile: Byes rule gives P (orret outome gents votes) = P (orret outome)p (gents votes orret outome)/p (gents votes). If the istriution over orret outomes is uniform, this expression is mximize y the mximum likelihoo estimte. This pproh les to inonsistent ylil rnkings (e.g. ) with nonzero proility, ut this oes not ffet the mximum likelihoo pproh. tht the voters votes re inepenent given the orret outome, it turns out tht only some rules hve this property. Answering our question hs t lest the following purposes: Rules tht hve the property re in sense more nturl thn ones tht o not, espeilly in settings where informtion ggregtion is the min purpose of voting. Hene, nswering the question will provie some guine in the prolem of hoosing rule. Showing tht rule oes hve the property requires us to onstrut noise moel, for whih the rule is the mximum likelihoo estimtor. Susequently, we n ssess whether the noise moel is resonle, or nees to e moifie to eome resonle. In the ltter se, the moifie noise moel my le to novel n useful voting rule. The rest of this pper is orgnize s follows. In Setion, we efine the ommon voting rules n efine the types of noise moel tht we onsier. In Setion 3, we present our positive results (noise moels tht hve ommon voting rules s their mximum likelihoo estimtor). In Setion, we present tehnique for showing tht no noise moel hs given rule s its mximum likelihoo estimtor, n pply this tehnique to otin our negtive results. Definitions.1 Voting rules We hve set of nites (k. lterntives) C over whih the voters vote. A vote is efine s strit orering (rnking) of the nites in C. A(voting) rule tkes the (vetor of) votes s input, n proues n outome. This outome n either e single nite (the winner), or rnking of the nites (where the top-rnke nite is the winner). Most rules llow for the possiility of ties, n o not speify how ties shoul e roken. In this pper, for our positive results, we o not ttempt to relize ny prtiulr tie-reking rule; our negtive results hol regrless of how ties re roken. We next efine the ommon voting rules tht we stuy. soring rules. Let α = α 1,...,α m e vetor of integers suh tht α 1 α... α m. For eh voter, nite reeives α 1 points if it is rnke first y the voter, α if it is rnke seon et. The sore s α of nite is the totl numer of points the nite reeives. The Bor rule is the soring rule with α = m 1,m,...,1,0. The plurlity rule (k. mjority rule) is the soring rule with α =
3 1, 0,...,0,0. The veto rule is the soring rule with α = 1, 1,...,1,0. Cnites re rnke y sore. single trnsferle vote (STV). The rule proees through series of m 1 rouns, eh one eliminting one nite. In eh roun, the nite with the lowest plurlity sore (tht is, the lest numer of voters rnking it first mong the remining nites) is rnke t the ottom of the remining nites. Then, tht nite is eliminte from the votes (eh of the votes for tht nite trnsfer to the next remining nite in the orer given in tht vote). The lst remining nite is the winner. Buklin. For ny nite n integer l, let B(, l) e the numer of voters tht rnk nite mong the top l nites. Cnite s Buklin sore is min{l : B(, l) >n/}), n nites re rnke oring to their sores (where lower sores re etter). Tht is, if we sy tht voter pproves her top l nites, then we repetely inrese l y 1, n whenever nite eomes pprove y more thn hlf the voters ( psses the post ), tht nite is ple next in the rnking. When multiple nites pss the post simultneously, ties re roken y the numer of votes y whih the post is psse. mximin (k. Simpson). Let N( 1, ) e the numer of votes tht rnk nite 1 higher thn nite. Cnite s mximin sore is min N(, ) (the nites worst sore in pirwise eletion). Cnites re rnke y sore. Copeln. A nite gins one Copeln point for every pirwise eletion it wins (one point for every suh tht N(, ) > N(,)), n loses one Copeln point for every pirwise eletion it loses (minus one point for every suh tht N(, ) < N(,)). Cnites re rnke y sore. rnke pirs. Sort ll orere pirs of nites (, ) yn(, ), the numer of voters who prefer to. Strting with the pir (, ) with the highest N(, ), we lok in the result of their pirwise eletion ( ). Then, we move to the next pir, n we lok the result of their pirwise eletion. We ontinue to lok every pirwise result tht oes not ontrit the orering estlishe so fr.. Noise moels In this pper, we will ple the following restritions on the noise moel. First, we require tht the noise is inepenent ross votes. Tht is, votes re onitionlly inepenent given the orret outome, s illustrte y the Byesin network elow. Seon, we require tht the onitionl istriution given the orret outome is the sme for eh vote vote 1 "orret" outome vote... vote n (for exmple, the first vote nnot e more likely to gree with the orret outome thn the seon vote). Together, the two restritions mount to the noise eing i.i.. These restritions strengthen our positive results tht show tht ertin rules n e interprete s mximum likelihoo estimtors. As for the negtive results tht ertin rules nnot e so interprete, it turns out tht without ny restritions on the noise moel, the question eomes trivil. Speifilly, if we o not mke the restrition tht votes re rwn inepenently given the orret outome, then ny rule is n MLE, s the following trivil proposition shows. Proposition 1 Any voting rule ρ n e interprete s mximum likelihoo estimtor (if we o not require tht votes re rwn inepenently given the orret outome). Moreover, if the rule is nonymous (it trets ll voters symmetrilly), then the noise moel n lso e nonymous (i.e. the onitionl istriution given the orret outome is the sme for eh vote). Proof: The following noise moel will suffie: given ny orret outome, let the proility of ll vote vetors on whih ρ proues n outome tht is ifferent from the orret outome e 0, n let the proility on ll other vote vetors e positive. We note tht if the rule is nonymous, then this is n nonymous noise moel. Hene, in the reminer of the pper, we mke the ove two restritions. We sy tht rule tht n e viewe s mximum likelihoo estimtor uner these restritions when the outome is winner is n MLEWIV (Mximum Likelihoo Estimtor for Winner uner I.i.. Votes) rule, n one tht n e viewe s mximum likelihoo estimtor uner these restritions when the outome is rnking is n MLERIV (Mximum Likelihoo Estimtor for Rnking uner I.i.. Votes) rule. 3 Voting rules tht n e interprete s MLEs In this setion, we ly out our positive results: we show whih of the ommon voting rules n e interprete s
4 mximum likelihoo estimtors uner the ssumption of i.i.. votes (oth for the se where the outome is the winner n the se where the outome is rnking). It turns out tht soring rules stisfy oth the MLEWIV n MLERIV properties. Theorem 1 Any soring rule is oth n MLEWIV n n MLERIV rule. n s(r j(w)) Proof: We first show tht every soring rule is n MLEWIV rule. If nite w is the winner in the orret outome, then let the proility (given the orret outome) of vote j tht rnks nite w in position r j (w) e proportionl to s(rj(w)) (where s(r) is the numer of points nite erives from eing rnke rth in vote). Thus, the proility of votes 1 through n given the( orret outome is pro- ) portionl to s(rj(w)) =. Of ourse, s(r j (w)) is extly nite w s sore. Now, the prolem of fining the mximum likelihoo estimte of the orret outome is the prolem of hoosing nite w to mximize the former expression. This is one y hoosing the nite with the highest sore n s(r j ()). Hene every soring rule is n MLEWIV rule. We next show tht every soring rule is lso n MLERIV rule. If the nites re rnke 1... m in the orret outome, then let the proility (given the orret outome) of vote j tht rnks nite i in position r j ( i ) e proportionl to m (m +1 i) s(rj(i)). Thus, the proility of votes 1 i=1 through n given the orret outome is proportionl ( to ) n m (m+1 i) s(rj(i)) = m s(r j( i)) (m+1 i). i=1 i=1 Of ourse, s(r j ( i )) is extly nite i s sore. Now, the prolem of fining the mximum likelihoo estimte of the orret outome is the prolem of leling the nites s i so s to mximize the former expression. Beuse m + 1 i is positive n eresing in i, this is one y leling the nite with the highest sore s(r j ()) s 1 (therey mximizing the numer of ftors m = m in the expression), the nite with the seon highest sore s, et. Hene every soring rule is n MLERIV rule. STV, on the other hn, stisfies only the MLERIV property (we will see lter tht it violtes the MLEWIV property). Theorem The STV rule is n MLERIV rule. Proof: Let the nites e rnke 1... m in the orret outome. Let δ j ( i ) = 1 if ll the nites tht re rnke higher thn i in vote j re ontine in { i+1, i+,..., m }, n let δ j ( i )=0 otherwise. Then, let the proility of vote j e proportionl to m k δj(i) i, where, for every i, 0<k i <1, i=1 n k i+1 is muh smller thn k i. Thus, the proility of votes 1 through n given the orret ( outome ) δ j( i) is proportionl to n m k δj(i) i = m ki. i=1 i=1 Agin, the prolem of fining the mximum likelihoo estimte of the orret outome is the prolem of leling the nites s i so s to mximize this expression. To o so, we must first minimize the numer of ftors k m, euse these ftors ominte. The numer of suh ftors is δ j ( m ), whih is the numer of votes tht rnk the nite tht we lel m first. Hene, we must rnk the nite tht is rnke first the fewest times lst (s m ). Next, we must minimize the numer of ftors k m 1. The numer of suh ftors is δ j ( m 1 ), whih is the numer of votes tht rnk the nite tht we lel m 1 either first, or seon fter m. Hene, we must rnk the nite tht is rnke first the fewest times fter m is remove seon-to-lst (s m 1 ) et. Thus the mximum likelihoo estimte of the rnking is extly the STV rnking. Hene, STV is n MLERIV rule. Voting rules tht nnot e interprete s MLEs In this setion, we will show tht some rules nnot e interprete s mximum likelihoo estimtors uner the restrition tht the votes re i.i.. (given the orret outome). To o so, we rely on the following lemm. Lemm 1 For given type of outome (e.g. winner or rnking), if there exist vetors of votes V 1, V suh tht rule ρ proues the sme outome on V 1 n V, ut ifferent outome on V 1 +V (the votes in V 1 n
5 V tken together), then ρ is not mximum likelihoo estimtor for tht type of outome uner i.i.. votes. Speifilly, if there exist vetors of votes V 1, V suh tht rule ρ proues the sme winner on V 1 n V, ut ifferent winner on V 1 + V, then ρ is not n MLEWIV rule; if there exist vetors of votes V 1, V suh tht rule ρ proues the sme rnking on V 1 n V, ut ifferent rnking on V 1 + V, then ρ is not n MLERIV rule. 3 Proof: Let s e the outome tht ρ proues on V 1 n on V. Given istriution suh tht s rg mx s P (V 1 S = s ) n s rg mx s P (V S = s ) (where S is the orret outome), we hve s rg mx s P (V 1 S = s )P (V S = s ) = rg mx s P (V 1 + V S = s ). But s is not the outome tht ρ proues on V 1 + V, so ρ is not mximum likelihoo estimtor for the istriution. vote 1... vote k vote k+1... vote n V1 "orret" outome Figure 1: Grphil illustrtion of Lemm 1. If the mximum likelihoo estimte for the orret outome given only the votes V 1 oinies with the the mximum likelihoo estimte given only the votes V, then it must lso oinie with the mximum likelihoo estimte given ll the votes V 1 + V. Below, when we use Lemm 1 to show tht rule is neither n MLEWIV nor n MLERIV rule, we will exhiit vetors of votes V 1 n V suh tht the rule proues the sme rnking on them (n hene lso the sme winner), ut the rule proues ifferent winner on V 1 +V (n hene lso ifferent rnking). Theorem 3 The Buklin rule is neither n MLEWIV nor n MLERIV rule. Proof: We will pply Lemm 1 to oth ses. Let V 1 ontin two votes e, n one 3 Suh proxil outomes re perhps reminisent of known prox in whih sttistil tests in two ifferent supopultions oth suggest tht tretment is helpful, ut when the t of the two tests re ggregte, this suggests tht the tretment is tully hrmful [1]! We note tht proof using Lemm 1 tht rule is not MLEWIV is not suffiient to show tht the rule is not MLERIV, euse in the proof, V 1 n V my proue the sme winner ut ifferent rnkings. V vote e. The following esries t whih points the nites pss the n/ votes mrk. is rnke the top nite y two votes; is rnke mong the top two nites y ll votes; is rnke mong the top three nites y ll votes; n is rnke mong the top four nites y ll votes. Hene the rnking proue y the Buklin rule on V 1 is e. Let V ontin two votes e, one vote e, n one vote e. The following esries t whih points the nites pss the n/ votes mrk. is rnke mong the top three nites y ll votes; is rnke mong the top three nites y three votes; is rnke mong the top four nites y ll votes; n is rnke mong the top four nites y three votes. Hene the rnking proue y the Buklin rule on V is e, the sme s on V 1. Now, onsier the rnking tht the Buklin rule proues on V 1 + V. The following esries t whih points the nites pss the n/ votes mrk. is rnke mong the top two nites y five votes; is rnke mong the top two nites y four votes; is rnke mong the top three nites y five votes; n is rnke mong the top four nites y six votes. Hene the rnking proue y the Buklin rule on V 1 + V is e. We hve lrey shown tht STV is n MLERIV rule, whih implies tht the onition of Lemm 1 for n MLERIV rule oes not hol. Still, it is interesting to see iretly why this onition oes not hol. Suppose tht we hve votes V 1 n votes V, on whih STV proues the sme rnking. The nite m rnke lst y STV in oth of V 1 n V reeives the lowest numer of votes in oth ses, n therefore must lso reeive the lowest numer of votes in V 1 + V, n e rnke lst in this se s well. Then, the nite m 1 rnke seon lst in oth of V 1 n V reeives the lowest numer of votes in oth ses fter the removl of m, n therefore must lso reeive the lowest numer of votes in V 1 +V fter the removl of m, n e rnke seon lst in this se s well et. Hene the rnking proue y the STV rule on V 1 +V must gree with tht proue on V 1 n V. However, this oes not yet imply tht the Lemm fils on STV for the MLEWIV property, n in ft it oes not: Theorem The STV rule is not n MLEWIV rule. Proof: We will pply Lemm 1. Let V 1 ontin three votes, four votes, n six votes
6 . Given these votes, rops out first; its three votes trnsfer to, who then hs seven votes, one more thn. Hene, wins the eletion on V 1 uner the STV rule. Let V ontin three votes, four votes, n six votes. Thus, V hs the sme votes s V 1, exept the roles of n re swithe. Hene wins the eletion on V uner the STV rule. Now, onsier the set of votes V 1 + V. n eh reeive nine votes, wheres reeives only eight votes. Hene, rops out first n nnot win. The remining rules re ll se on pirwise eletions. For these, it is useful to onsier the pirwise eletion grph etween the nites, in whih there is irete ege from nite to nite with weight w if efets y w votes in their pirwise eletion. For exmple, if the votes re n, then the pirwise eletion grph is: Proof: We will pply Lemm 1 to oth ses. Let V 1 relize the following pirwise eletion grph (y Lemm ): A nite s Copeln sore is the numer of outgoing eges minus the numer of inoming eges. Therefore, the sores in this eletion re s follows: gets points, gets 1 point, gets 0 points, gets 1 point, n e gets points. Hene the rnking proue y the Copeln rule on V 1 is e. Let V relize the following pirwise eletion grph (y Lemm ): e e In the remining proofs, when we pply Lemm 1, it will e esier not to give the votes in V 1 n V, ut rther only the pirwise eletion grphs for V 1 n V. (The pirwise eletion grph of V 1 + V n e inferre from these grphs y summing their eges.) Of ourse, this pproh is legitimte only if we n show tht there o inee exist votes for V 1 n V tht relize these grphs. This is the purpose of the following lemm. Lemm For ny pirwise eletion grph G whose weights re even-vlue integers, votes n e onstrute tht relize G. Proof: To inrese the weight on the ege from nite to y without ffeting ny other weights, we n the following two votes (where 1,,..., m re the remining nites): 1... m, m m Hene we n relize ny pirwise eletion grph G with even-vlue integer weights. The Copeln sores in this eletion re s follows: gets points, gets 1 point, gets 0 points, gets 1 point, n e gets points. Hene the rnking proue y the Copeln rule on V is e, the sme s on V 1. The pirwise eletion grph of V 1 +V is the following: The Copeln sores in this eletion re s follows: gets points, gets 1 point, gets 0 points, gets 1 point, n e gets points. Hene the rnking proue y the Copeln rule on V 1 + V is e. e Theorem 5 The Copeln rule is neither n MLEWIV nor n MLERIV rule. Theorem 6 The mximin rule is neither n MLEWIV nor n MLERIV rule.
7 Proof: We will pply Lemm 1 to oth ses. Let V 1 relize the following pirwise eletion grph (y Lemm ): In this eletion, s worst pirwise efet is y 6 votes; s worst pirwise efet is y 8 votes; s worst pirwise efet is y 10 votes; n s worst pirwise efet is y 1 votes. Hene the rnking proue y the mximin rule on V 1 is. Let V relize the following pirwise eletion grph (y Lemm ): In this eletion, the pirwise rnkings re loke in s follows. First, is loke in; then, is loke in; then is inonsistent with the rnkings loke in lrey, so the next pirwise rnking loke in is ; n finlly, is loke in. Hene the rnking proue y the rnke pirs rule on V 1 is. Let V relize the following pirwise eletion grph (y Lemm ): In this eletion, gin, s worst pirwise efet is y 6 votes; s worst pirwise efet is y 8 votes; s worst pirwise efet is y 10 votes; n s worst pirwise efet is y 1 votes. Hene the rnking proue y the mximin rule on V is, the sme s on V 1. The pirwise eletion grph of V 1 +V is the following: 6 8 In this eletion, s worst pirwise efet is y votes; s worst pirwise efet is y votes; s worst pirwise efet is y 6 votes; n s worst pirwise efet is y 8 votes. Hene the rnking proue y the mximin rule on V 1 + V is. Theorem 7 The rnke pirs rule is neither n MLEWIV nor n MLERIV rule. Proof: We will pply Lemm 1 to oth ses. Let V 1 relize the following pirwise eletion grph (y Lemm ): In this eletion, the pirwise rnkings re loke in s follows. First, is loke in; then, is loke in; then is inonsistent with the rnkings loke in lrey, so the next pirwise rnking loke in is ; n finlly, is loke in. Hene the rnking proue y the rnke pirs rule on V is, the sme s on V 1. The pirwise eletion grph of V 1 +V is the following: In this eletion, the pirwise rnkings re loke in s follows. First, is loke in; then, is loke in; then, is inonsistent with the rnkings loke in lrey, so the next pirwise rnking loke in is ; then, is inonsistent with the rnkings loke in lrey, so the next (n lst) pirwise rnking loke in is. Hene the rnking proue y the rnke pirs rule on V 1 + V is. Among the ommon voting rules tht we hve stuie, none is n MLEWIV rule ut not n MLERIV rule. So, one my woner if perhps the MLEWIV property implies the MLERIV property. To see tht this is not the se, onsier hyri rule A tht first hooses winner oring to some MLEWIV rule B, 18
8 n proues the rnking of the remining nites oring to rule C whih is not n MLERIV rule. A is n MLEWIV rule euse B is, ut it is not n MLERIV rule euse C is not. 5 Conlusions n future reserh Voting is very generl metho of preferene ggregtion. We onsiere the following view of voting: there exists orret outome (winner/rnking), n eh voter s vote orrespons to noisy pereption of this orret outome. Given the noise moel, for ny vetor of votes, we n ompute the mximum likelihoo estimte of the orret outome. This mximum likelihoo estimte onstitutes voting rule. In this pper, we ske the following question: For whih ommon voting rules oes there exist noise moel suh tht the rule is the mximum likelihoo estimte for tht noise moel? The following tle summrizes our results for the rules isusse in this pper. MLERIV MLERIV Soring rules Hyris of MLEWIV (inl. plurlity, MLEWIV n Bor, veto) MLERIV Buklin MLEWIV STV Copeln mximin rnke pirs Clssifition of voting rules isusse in this pper. We elieve the tehniques tht we use to prove these results shoul e esy to pply to other rules s well. There re mny questions left to e nswere y future reserh, inluing t lest the following. How resonle re the noise moels tht we gve to show tht ertin rules re MLEWIV or MLERIV rules? To the extent tht they re not resonle, n we improve them? Do these improve noise moels le to the sme rules, or ifferent (n possily ltogether new) ones? For the rules tht we showe re not MLEWIV or MLERIV rules, n we still interpret them s mximum likelihoo estimtors if we relx somewht the ssumption of votes eing rwn inepenently? (If we hve no restrition t ll, then Proposition 1 shows tht this n lwys e one.) Alterntively, re there other rules tht n e interprete s mximum likelihoo estimtors uner our inepenene ssumption, while prouing outomes tht re lose to those proue y rules tht nnot e so interprete? Finlly, re there rules tht re not MLEWIV/MLERIV ut for whih Lemm 1 nnot e use to show this, or oes Lemm 1 in ft lso provie us with suffiient onition for rule eing MLEWIV/MLERIV? Referenes [1] Alon Altmn n Moshe Tennennholtz. Rnking systems: The PgeRnk xioms. In Proeeings of the ACM Conferene on Eletroni Commere (ACM- EC), Vnouver, Cn, 005. [] Vinent Conitzer, Jerome Lng, n Tuoms Snholm. How mny nites re neee to mke eletions hr to mnipulte? In Theoretil Aspets of Rtionlity n Knowlege (TARK), pges 01 1, Bloomington, Inin, USA, 003. [3] Vinent Conitzer n Tuoms Snholm. Complexity of mnipulting eletions with few nites. In Proeeings of the Ntionl Conferene on Artifiil Intelligene (AAAI), pges , Emonton, Cn, 00. [] Vinent Conitzer n Tuoms Snholm. Vote eliittion: Complexity n strtegy-proofness. In AAAI, pges , Emonton, Cn, 00. [5] Vinent Conitzer n Tuoms Snholm. Universl voting protool tweks to mke mnipultion hr. In Proeeings of the Eighteenth Interntionl Joint Conferene on Artifiil Intelligene (IJCAI), pges , Apulo, Mexio, 003. [6] Vinent Conitzer n Tuoms Snholm. Communition omplexity of ommon voting rules. In ACM- EC, Vnouver, Cn, 005. [7] Anrew Dvenport n Jynt Klgnnm. A omputtionl stuy of the Kemeny rule for preferene ggregtion. In AAAI, pges , Sn Jose, CA, USA, 00. [8] Mrie Jen Antoine Niols e Critt (Mrquis e Conoret). Essi sur l pplition e l nlyse l proilite es eisions renues l plurlite es voix. Pris: L Imprimerie Royle, [9] Mohme Drissi n Mihel Truhon. Mximum likelihoo pproh to vote ggregtion with vrile proilities. Tehnil Report 011, Deprtement eonomique, Universite Lvl, 00. [10] Eithn Ephrti n Jeffrey S Rosenshein. The Clrke tx s onsensus mehnism mong utomte gents. In AAAI, pges , Anheim, CA, [11] Eithn Ephrti n Jeffrey S Rosenshein. Multigent plnning s ynmi serh for soil onsensus. In IJCAI, pges 3 9, Chmery, Frne, [1] John Kemeny. Mthemtis without numers. In Delus, volume 88, pges [13] Dvi M Pennok, Eri Horvitz, n C. Lee Giles. Soil hoie theory n reommener systems: Anlysis of the xiomti fountions of ollortive filtering. In AAAI, pges 79 73, Austin, TX, 000. [1] Donl G. Sri. A hoti explortion of ggregtion proxes. SIAM Review, 37:37 5, [15] Peyton Young. Optiml voting rules. Journl of Eonomi Perspetives, 9(1):51 6, 1995.
Arrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationOn the Axiomatic Foundations of Ranking Systems
On the Axiomti Fountions of Rnking Systems Alon Altmn n Moshe Tennenholtz Fulty of Inustril Engineering n Mngement Tehnion Isrel Institute of Tehnology Hif 32000 Isrel Astrt Resoning out gent preferenes
More informationChoix Social Computationnel
Choix Soil Computtionnel Niols Muet niols.muet@lip6.fr Université Pierre et Mrie Curie 05 Septemre 2011 Motivtion Quest for the est voting system Niols Muet 05 Septemre 2011 Bsis of Soil Choie Mnipultion
More informationNow we must transform the original model so we can use the new parameters. = S max. Recruits
MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationCARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005
RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More information2.4 Theoretical Foundations
2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
More informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More informationProbability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright
Proility The Lnguge of Chne Stuent Book - Series L-1 P(A) Mthletis Instnt Workooks Copyright Proility The Lnguge of Chne Stuent Book - Series L Contents Topis Topi 1 - Lnguge of proility Topi 2 - Smple
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationPOSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationCommon intervals of genomes. Mathieu Raffinot CNRS LIAFA
Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of
More informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationBounded single-peaked width and proportional representation 1
Boune single-peke with n proportionl representtion 1 Denis Cornz, Luie Gln n Olivier Spnjr Astrt This pper is evote to the proportionl representtion (PR) prolem when the preferenes re lustere single-peke.
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationIncentives for Participation and Abstention in Probabilistic Social Choice
Inentives for Prtiiption n Astention in Proilisti Soil Choie Florin Brnl Institut für Informtik TU Münhen, Germny rnlfl@in.tum.e Felix Brnt Institut für Informtik TU Münhen, Germny rntf@in.tum.e Johnnes
More informationy = c 2 MULTIPLE CHOICE QUESTIONS (MCQ's) (Each question carries one mark) is...
. Liner Equtions in Two Vriles C h p t e r t G l n e. Generl form of liner eqution in two vriles is x + y + 0, where 0. When we onsier system of two liner equtions in two vriles, then suh equtions re lle
More informationSeparable discrete functions: recognition and sufficient conditions
Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...
More informationCSC2542 State-Space Planning
CSC2542 Stte-Spe Plnning Sheil MIlrith Deprtment of Computer Siene University of Toronto Fll 2010 1 Aknowlegements Some the slies use in this ourse re moifitions of Dn Nu s leture slies for the textook
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationPhylogenies via Quartets
Phylogenies vi Qurtets Dvi Brynt rynt@mth.mgill. LIRMM, Frne CRM, U. e M. U. Cnterury MGill University Bite-size trees There is only one unroote tree for one, two or three tx... But there re four unroote
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationOn the Spectra of Bipartite Directed Subgraphs of K 4
On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,
More informationLecture 4: Graph Theory and the Four-Color Theorem
CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen
More informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
More informationData Structures LECTURE 10. Huffman coding. Example. Coding: problem definition
Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationSolids of Revolution
Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk
More informationTechnology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework
R-17 SASIMI 015 Proeeings Tehnology Mpping Metho for Low Power Consumption n High Performne in Generl-Synhronous Frmework Junki Kwguhi Yukihie Kohir Shool of Computer Siene, the University of Aizu Aizu-Wkmtsu
More informationCS 360 Exam 2 Fall 2014 Name
CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationLet s divide up the interval [ ab, ] into n subintervals with the same length, so we have
III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris
More informationExam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM
riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting
More informationComputing on rings by oblivious robots: a unified approach for different tasks
Computing on rings y olivious roots: unifie pproh for ifferent tsks Ginlorenzo D Angelo, Griele Di Stefno, Alfreo Nvrr, Niols Nisse, Krol Suhn To ite this version: Ginlorenzo D Angelo, Griele Di Stefno,
More informationMATH 122, Final Exam
MATH, Finl Exm Winter Nme: Setion: You must show ll of your work on the exm pper, legily n in etil, to reeive reit. A formul sheet is tthe.. (7 pts eh) Evlute the following integrls. () 3x + x x Solution.
More informationEquivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.
Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions
More informationMomentum and Energy Review
Momentum n Energy Review Nme: Dte: 1. A 0.0600-kilogrm ll trveling t 60.0 meters per seon hits onrete wll. Wht spee must 0.0100-kilogrm ullet hve in orer to hit the wll with the sme mgnitue of momentum
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationMCH T 111 Handout Triangle Review Page 1 of 3
Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:
More informationOn the Revision of Argumentation Systems: Minimal Change of Arguments Status
On the Revision of Argumenttion Systems: Miniml Chnge of Arguments Sttus Sylvie Coste-Mrquis, Séstien Koniezny, Jen-Guy Milly, n Pierre Mrquis CRIL Université Artois CNRS Lens, Frne {oste,koniezny,milly,mrquis}@ril.fr
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationIntroduction to Graphical Models
Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II Introution n Review 2 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set
More informationMaximum size of a minimum watching system and the graphs achieving the bound
Mximum size of minimum wthing system n the grphs hieving the oun Tille mximum un système e ontrôle minimum et les grphes tteignnt l orne Dvi Auger Irène Chron Olivier Hury Antoine Lostein 00D0 Mrs 00 Déprtement
More informationStatistics in medicine
Sttistis in meiine Workshop 1: Sreening n ignosti test evlution Septemer 22, 2016 10:00 AM to 11:50 AM Hope 110 Ftm Shel, MD, MS, MPH, PhD Assistnt Professor Chroni Epiemiology Deprtment Yle Shool of Puli
More informationF / x everywhere in some domain containing R. Then, + ). (10.4.1)
0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution
More informationOutline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression
5-2 Dt Strutures n Algorithms Dt Compression n Huffmn s Algorithm th Fe 2003 Rjshekr Rey Outline Dt ompression Lossy n lossless Exmples Forml view Coes Definition Fixe length vs. vrile length Huffmn s
More informationTotal score: /100 points
Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore
More informationDIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS
Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationYear 10 Maths. Semester One Revision Booklet.
Yer 0 Mths. Semester One Revision Booklet. Nme YEAR 0 MATHEMATICS REVISION BOOKLET AND STUDY SUGGESTIONS NAME: READ through ALL of this vie prior to strting your revision. It is essentil informtion. Chpters
More informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationAnalysis of Temporal Interactions with Link Streams and Stream Graphs
Anlysis of Temporl Intertions with n Strem Grphs, Tiphine Vir, Clémene Mgnien http:// ltpy@ LIP6 CNRS n Soronne Université Pris, Frne 1/23 intertions over time 0 2 4 6 8,,, n for 10 time units time 2/23
More informationLecture 11 Binary Decision Diagrams (BDDs)
C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et
More informationConsistent Probabilistic Social Choice
Consistent Proilisti Soil Choie Felix Brndt (with F. Brndl nd H. G. Seedig) University of Oxford, Novemer 2015 Preliminries Finite set of lterntives A A is not fixed Liner preferene reltions L (A) Frtionl
More informationSection 2.1 Special Right Triangles
Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS
ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu
More information10.7 Assessment criteria for the individual investigation
Unit 6 Prtil Biology n Investigtive Skills 10.7 for the iniviul investigtion Reserh n rtionle There is some ttempt to provie rtionle for the hoie of investigtion in terms of its sope n its reltion to iologil
More informationBehavior Composition in the Presence of Failure
Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationMathematical Proofs Table of Contents
Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry
More information