{"id":3682,"date":"2023-11-23T08:22:05","date_gmt":"2023-11-23T13:22:05","guid":{"rendered":"https:\/\/sites.williams.edu\/Morgan\/?page_id=3682"},"modified":"2023-11-27T15:54:52","modified_gmt":"2023-11-27T20:54:52","slug":"the-ideal-voting-system","status":"publish","type":"page","link":"https:\/\/sites.williams.edu\/Morgan\/math-chat-archives\/the-ideal-voting-system\/","title":{"rendered":"The Ideal Voting System"},"content":{"rendered":"<p>June 22, 2000<\/p>\n<p>&nbsp;<\/p>\n<p>What do you think is the best voting system among three or more candidates? Rank the following from 1 (best) to 4 (worst) and return to\u00a0<a href=\"mailto:mackenzi@cruzio.com\">mackenzi@cruzio.com<\/a>\u00a0by June 27.<\/p>\n<p>_____Plurality (whoever gets the most votes wins)<\/p>\n<p>_____Runoff (between two highest vote getters)<\/p>\n<p>_____Approval voting (voter votes for all acceptable candidates and the candidate so approved by the most voters wins)<\/p>\n<p>_____Ranking (voter ranks the candidates from 1 to n and the candidate with the smallest sum of rankings wins)<\/p>\n<p>All four methods have paradoxical consequences, in which a majority of the voters would prefer another candidate over the winner. (See\u00a0<a href=\"http:\/\/www.sciam.com\/askexpert\/math\/math2.html\">&#8220;Ask the Experts&#8221;<\/a>\u00a0and\u00a0<a href=\"http:\/\/www.csmonitor.com\/cgi-bin\/getasciiarchive?script\/96\/11\/08\/110896.feat.feat.2\">Math Chat<\/a>\u00a0of November 8, 1996.) Results of this poll will appear in the next Math Chat July 6 and in the November issue of\u00a0<i>Discover<\/i>\u00a0magazine.<\/p>\n<p><b>New Challenge.<\/b>\u00a0Design your own voting system and submit it to MathChat &lt;<a href=\"mailto:Frank.Morgan@williams.edu\">Frank.Morgan@williams.edu<\/a>&gt;. The winning answer will appear in the next Math Chat July 6.<\/p>\n<p><b>Old Challenge.<\/b>\u00a0(Salvador Segura Gomis). What is the shortest line segment fencing off prescribed area 0<\/p>\n<p><b>Answer<\/b>\u00a0(Joseph DeVincentis). We may as well assume that A is at most 1\/2, since a larger area on one side corresponds to a smaller area on the other side. For A up to 1\/4, fence off a corner diagonally. For A from 1\/4 to 1\/2, just use a horizontal fence.<\/p>\n<p>Similarly in the unit cube, for small volume slice off a corner; for intermediate volume slice off an edge; for larger volume use a horizontal plane. The transitional values turn out to be 2<sup>8<\/sup>\/3<sup>7<\/sup>\u00a0and 1\/4.<\/p>\n<p>For a 4D cube, for small volume slice off a corner; for somewhat larger volume slice off an edge; for somewhat larger volume slice off a 2D face; for larger volume use a horizontal hyperplane. The transitional values are 3<sup>17<\/sup>\/2<sup>31<\/sup>, 2<sup>8<\/sup>\/3<sup>7<\/sup>, and 1\/4.<\/p>\n<p>Joe Shipman reports that the transitional volumes for general dimensions are (1-1\/n)<sup>1.5n(n-1)<\/sup>\u00a0n<sup>n<\/sup>\/n! Plugging in n = 2, 3, 4 yields 1\/4, 2<sup>8<\/sup>\/3<sup>7<\/sup>, and 3<sup>17<\/sup>\/2<sup>31<\/sup><\/p>\n<p>&nbsp;<\/p>\n<hr \/>\n<p><a>Send answers, comments, and new questions by email to\u00a0<\/a><a href=\"mailto:Frank.Morgan@williams.edu\">Frank.Morgan@williams.edu,<\/a>\u00a0to be eligible for<i>\u00a0Flatland\u00a0<\/i>and other book awards. Winning answers will appear in the next Math Chat. Math Chat appears on the first and third Thursdays of each month. Prof. Morgan&#8217;s homepage is at\u00a0<a href=\"http:\/\/www.williams.edu\/Mathematics\/fmorgan\">www.williams.edu\/Mathematics\/fmorgan.<\/a><\/p>\n<p><a href=\"http:\/\/www.maa.org\/books\/mch.html\">THE MATH CHAT BOOK,<\/a>\u00a0including a $1000 Math Chat Book\u00a0<a href=\"http:\/\/www.maa.org\/books\/quest.html\">QUEST,\u00a0<\/a>questions and answers, and a list of past challenge winners, is now available from the MAA (800-331-1622).<\/p>\n<p>Copyright 2000, Frank Morgan.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>June 22, 2000 &nbsp; What do you think is the best voting system among three or more candidates? Rank the following from 1 (best) to 4 (worst) and return to\u00a0mackenzi@cruzio.com\u00a0by June 27. _____Plurality (whoever gets the most votes wins) _____Runoff (between two highest vote getters) _____Approval voting (voter votes for all acceptable candidates and the [&hellip;]<\/p>\n","protected":false},"author":2965,"featured_media":0,"parent":3459,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":["post-3682","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3682","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/users\/2965"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/comments?post=3682"}],"version-history":[{"count":3,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3682\/revisions"}],"predecessor-version":[{"id":3776,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3682\/revisions\/3776"}],"up":[{"embeddable":true,"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/pages\/3459"}],"wp:attachment":[{"href":"https:\/\/sites.williams.edu\/Morgan\/wp-json\/wp\/v2\/media?parent=3682"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}