Search versus Decision for Election Manipulation Problems

Search versus Decision for Election Manipulation Problems

Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for man...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2012-03
Hauptverfasser: Hemaspaandra, Edith, Hemaspaandra, Lane A, Menton, Curtis
Format: Artikel
Sprache:eng
Schlagworte:
Decision theory
Elections
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Hemaspaandra, Edith
Hemaspaandra, Lane A
Menton, Curtis
description Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2081783980</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2081783980</sourcerecordid><originalsourceid>FETCH-proquest_journals_20817839803</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwDE5NLErOUChLLSouLVZwSU3OLM7Mz1NIyy9ScM1JTS4BcXwT8zILSnMSwZyAovyknNTcYh4G1rTEnOJUXijNzaDs5hri7KFbUJRfWJpaXBKflV9alAeUijcysDA0tzC2tDAwJk4VAJgENrU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2081783980</pqid></control><display><type>article</type><title>Search versus Decision for Election Manipulation Problems</title><source>Free E- Journals</source><creator>Hemaspaandra, Edith ; Hemaspaandra, Lane A ; Menton, Curtis</creator><creatorcontrib>Hemaspaandra, Edith ; Hemaspaandra, Lane A ; Menton, Curtis</creatorcontrib><description>Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Decision theory ; Elections ; Polynomials</subject><ispartof>arXiv.org, 2012-03</ispartof><rights>2012. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>778,782</link.rule.ids></links><search><creatorcontrib>Hemaspaandra, Edith</creatorcontrib><creatorcontrib>Hemaspaandra, Lane A</creatorcontrib><creatorcontrib>Menton, Curtis</creatorcontrib><title>Search versus Decision for Election Manipulation Problems</title><title>arXiv.org</title><description>Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.</description><subject>Decision theory</subject><subject>Elections</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwDE5NLErOUChLLSouLVZwSU3OLM7Mz1NIyy9ScM1JTS4BcXwT8zILSnMSwZyAovyknNTcYh4G1rTEnOJUXijNzaDs5hri7KFbUJRfWJpaXBKflV9alAeUijcysDA0tzC2tDAwJk4VAJgENrU</recordid><startdate>20120306</startdate><enddate>20120306</enddate><creator>Hemaspaandra, Edith</creator><creator>Hemaspaandra, Lane A</creator><creator>Menton, Curtis</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20120306</creationdate><title>Search versus Decision for Election Manipulation Problems</title><author>Hemaspaandra, Edith ; Hemaspaandra, Lane A ; Menton, Curtis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20817839803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Decision theory</topic><topic>Elections</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Hemaspaandra, Edith</creatorcontrib><creatorcontrib>Hemaspaandra, Lane A</creatorcontrib><creatorcontrib>Menton, Curtis</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hemaspaandra, Edith</au><au>Hemaspaandra, Lane A</au><au>Menton, Curtis</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Search versus Decision for Election Manipulation Problems</atitle><jtitle>arXiv.org</jtitle><date>2012-03-06</date><risdate>2012</risdate><eissn>2331-8422</eissn><abstract>Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2012-03
issn 2331-8422
language eng
recordid cdi_proquest_journals_2081783980
source Free E- Journals
subjects Decision theory
Elections
Polynomials
title Search versus Decision for Election Manipulation Problems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T09%3A33%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Search%20versus%20Decision%20for%20Election%20Manipulation%20Problems&rft.jtitle=arXiv.org&rft.au=Hemaspaandra,%20Edith&rft.date=2012-03-06&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2081783980%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2081783980&rft_id=info:pmid/&rfr_iscdi=true