MATH 1007 Lecture 1: Two Candidate Elections
Document Summary
Profile a list ofthepreferences of the voters a list ofhowmanyvoteseach tabulated profile canidategets see. 12 of the votes not decisive provingthis is the bestmethod canidate must win a predetermined proportion p 12 one voter whoa choicealways wins one canidate wins no matter what voters want a supermajority. Ex 1 no matter vote a tie canidate gets minority hewins. A a a bb b aa b aa b if not tie. Profiles are if allvoterstreatedequally ignored outcomedepends on tabulated profiles canidatestreated equally. Changing all a to b votes 3 b to a votes winnerchanges thevote of a particular voterfor a canidate votes a prob of winning a vote0 nonwinner to winner cannotanidate. There is always a winner no chance no ties euntially impossible. Always a winner unless a tie true tie. May"s theorem a theonly sce that is a n m wd is simplemajority.
