Normalized Range Voting Broadly Resists Control
We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the participation or structure of an election in order to change the outcome. We show that a voting system resists a case of con...
Gespeichert in:
| Veröffentlicht in: | Theory of computing systems 2013-11, Vol.53 (4), p.507-531 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 531 |
|---|---|
| container_issue | 4 |
| container_start_page | 507 |
| container_title | Theory of computing systems |
| container_volume | 53 |
| creator | Menton, Curtis |
| description | We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the participation or structure of an election in order to change the outcome. We show that a voting system resists a case of control by proving that performing that case of control is computationally hard. Range Voting is a natural extension of approval voting, and Normalized Range Voting is a simple variant which alters each vote to maximize the potential impact of each voter. We show that Normalized Range Voting has among the largest known number of control resistances among natural voting systems. |
| doi_str_mv | 10.1007/s00224-012-9441-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1429857273</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1429857273</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-94b98d332556ae8b1fe33f2b7bd6fa536f4103a39ba469cd50c7225f9270bec43</originalsourceid><addsrcrecordid>eNp1kD1PwzAURS0EEqXwA9gisbCEPvvZcTxCxZdUgVQBq-UkdpUqjYudDvDrcQkDQmJ6bzj36uoQck7higLIWQRgjOdAWa44pzkckAnliDlwBYffP8s5CjgmJzGuAQBLgAmZPfmwMV37aZtsafqVzd780Par7CZ403Qf2dLGNg4xm_t-CL47JUfOdNGe_dwpeb27fZk_5Ivn-8f59SKvkashbahU2SAyIQpjy4o6i-hYJaumcEZg4TgFNKgqwwtVNwJqyZhwikmobM1xSi7H3m3w7zsbB71pY227zvTW76KmnKlSSCYxoRd_0LXfhT6tSxSVHFCgTBQdqTr4GIN1ehvajQkfmoLeK9SjQp0U6r1CDSnDxkxMbHITfjX_G_oChWFxZQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1417403537</pqid></control><display><type>article</type><title>Normalized Range Voting Broadly Resists Control</title><source>SpringerNature Journals</source><source>EBSCOhost Business Source Complete</source><creator>Menton, Curtis</creator><creatorcontrib>Menton, Curtis</creatorcontrib><description>We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the participation or structure of an election in order to change the outcome. We show that a voting system resists a case of control by proving that performing that case of control is computationally hard. Range Voting is a natural extension of approval voting, and Normalized Range Voting is a simple variant which alters each vote to maximize the potential impact of each voter. We show that Normalized Range Voting has among the largest known number of control resistances among natural voting systems.</description><identifier>ISSN: 1432-4350</identifier><identifier>EISSN: 1433-0490</identifier><identifier>DOI: 10.1007/s00224-012-9441-0</identifier><identifier>CODEN: TCSYFI</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Analysis ; Approximation ; Bribery ; Candidates ; Chairs ; Computation ; Computational mathematics ; Computer Science ; Control systems ; Elections ; Phase transitions ; Preferences ; Resistance to control ; Resists ; Social sciences ; Studies ; Surface hardness ; Theory of Computation ; Voters ; Voting ; Voting machines ; Voting systems</subject><ispartof>Theory of computing systems, 2013-11, Vol.53 (4), p.507-531</ispartof><rights>Springer Science+Business Media New York 2012</rights><rights>Springer Science+Business Media New York 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-94b98d332556ae8b1fe33f2b7bd6fa536f4103a39ba469cd50c7225f9270bec43</citedby><cites>FETCH-LOGICAL-c349t-94b98d332556ae8b1fe33f2b7bd6fa536f4103a39ba469cd50c7225f9270bec43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00224-012-9441-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00224-012-9441-0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Menton, Curtis</creatorcontrib><title>Normalized Range Voting Broadly Resists Control</title><title>Theory of computing systems</title><addtitle>Theory Comput Syst</addtitle><description>We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the participation or structure of an election in order to change the outcome. We show that a voting system resists a case of control by proving that performing that case of control is computationally hard. Range Voting is a natural extension of approval voting, and Normalized Range Voting is a simple variant which alters each vote to maximize the potential impact of each voter. We show that Normalized Range Voting has among the largest known number of control resistances among natural voting systems.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Approximation</subject><subject>Bribery</subject><subject>Candidates</subject><subject>Chairs</subject><subject>Computation</subject><subject>Computational mathematics</subject><subject>Computer Science</subject><subject>Control systems</subject><subject>Elections</subject><subject>Phase transitions</subject><subject>Preferences</subject><subject>Resistance to control</subject><subject>Resists</subject><subject>Social sciences</subject><subject>Studies</subject><subject>Surface hardness</subject><subject>Theory of Computation</subject><subject>Voters</subject><subject>Voting</subject><subject>Voting machines</subject><subject>Voting systems</subject><issn>1432-4350</issn><issn>1433-0490</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kD1PwzAURS0EEqXwA9gisbCEPvvZcTxCxZdUgVQBq-UkdpUqjYudDvDrcQkDQmJ6bzj36uoQck7higLIWQRgjOdAWa44pzkckAnliDlwBYffP8s5CjgmJzGuAQBLgAmZPfmwMV37aZtsafqVzd780Par7CZ403Qf2dLGNg4xm_t-CL47JUfOdNGe_dwpeb27fZk_5Ivn-8f59SKvkashbahU2SAyIQpjy4o6i-hYJaumcEZg4TgFNKgqwwtVNwJqyZhwikmobM1xSi7H3m3w7zsbB71pY227zvTW76KmnKlSSCYxoRd_0LXfhT6tSxSVHFCgTBQdqTr4GIN1ehvajQkfmoLeK9SjQp0U6r1CDSnDxkxMbHITfjX_G_oChWFxZQ</recordid><startdate>20131101</startdate><enddate>20131101</enddate><creator>Menton, Curtis</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20131101</creationdate><title>Normalized Range Voting Broadly Resists Control</title><author>Menton, Curtis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-94b98d332556ae8b1fe33f2b7bd6fa536f4103a39ba469cd50c7225f9270bec43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Approximation</topic><topic>Bribery</topic><topic>Candidates</topic><topic>Chairs</topic><topic>Computation</topic><topic>Computational mathematics</topic><topic>Computer Science</topic><topic>Control systems</topic><topic>Elections</topic><topic>Phase transitions</topic><topic>Preferences</topic><topic>Resistance to control</topic><topic>Resists</topic><topic>Social sciences</topic><topic>Studies</topic><topic>Surface hardness</topic><topic>Theory of Computation</topic><topic>Voters</topic><topic>Voting</topic><topic>Voting machines</topic><topic>Voting systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Menton, Curtis</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Theory of computing systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Menton, Curtis</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Normalized Range Voting Broadly Resists Control</atitle><jtitle>Theory of computing systems</jtitle><stitle>Theory Comput Syst</stitle><date>2013-11-01</date><risdate>2013</risdate><volume>53</volume><issue>4</issue><spage>507</spage><epage>531</epage><pages>507-531</pages><issn>1432-4350</issn><eissn>1433-0490</eissn><coden>TCSYFI</coden><abstract>We study the behavior of Range Voting and Normalized Range Voting with respect to electoral control. Electoral control encompasses attempts from an election chair to alter the participation or structure of an election in order to change the outcome. We show that a voting system resists a case of control by proving that performing that case of control is computationally hard. Range Voting is a natural extension of approval voting, and Normalized Range Voting is a simple variant which alters each vote to maximize the potential impact of each voter. We show that Normalized Range Voting has among the largest known number of control resistances among natural voting systems.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s00224-012-9441-0</doi><tpages>25</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1432-4350 |
| ispartof | Theory of computing systems, 2013-11, Vol.53 (4), p.507-531 |
| issn | 1432-4350 1433-0490 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1429857273 |
| source | SpringerNature Journals; EBSCOhost Business Source Complete |
| subjects | Algorithms Analysis Approximation Bribery Candidates Chairs Computation Computational mathematics Computer Science Control systems Elections Phase transitions Preferences Resistance to control Resists Social sciences Studies Surface hardness Theory of Computation Voters Voting Voting machines Voting systems |
| title | Normalized Range Voting Broadly Resists Control |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T03%3A10%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Normalized%20Range%20Voting%20Broadly%20Resists%20Control&rft.jtitle=Theory%20of%20computing%20systems&rft.au=Menton,%20Curtis&rft.date=2013-11-01&rft.volume=53&rft.issue=4&rft.spage=507&rft.epage=531&rft.pages=507-531&rft.issn=1432-4350&rft.eissn=1433-0490&rft.coden=TCSYFI&rft_id=info:doi/10.1007/s00224-012-9441-0&rft_dat=%3Cproquest_cross%3E1429857273%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1417403537&rft_id=info:pmid/&rfr_iscdi=true |