{"id":5392,"date":"2021-12-05T18:34:08","date_gmt":"2021-12-05T13:04:08","guid":{"rendered":"https:\/\/gtl.csa.iisc.ac.in\/hari\/?page_id=5392"},"modified":"2021-12-09T10:33:13","modified_gmt":"2021-12-09T05:03:13","slug":"frugal-bribery-in-voting","status":"publish","type":"page","link":"https:\/\/gtl.csa.iisc.ac.in\/hari\/publications\/research-snippets\/frugal-bribery-in-voting\/","title":{"rendered":"Frugal Bribery in Voting"},"content":{"rendered":"\n<p>In computational social choice, bribery refers to an external agent trying to influence the election outcome by persuading\u00a0 a certain targeted set of agents to vote in favor of some particular candidate. This work studies <em>frugal bribers<\/em> \u00a0who will persuade only those (vulnerable) voters who themselves also prefer the new election outcome that results if the briber succeeds in the mission. \u00a0Our key result is seemingly surprising: \u00a0the computational problem of frugal bribery, that is which vulnerable voters report what preferences so that the \u00a0candidate favored by the briber wins the election, is intractable. Our results establish \u00a0that elections typically are more robust against bribery compared to other types of election controls such as manipulation.<\/p>\n\n\n\n<p><strong>Reference:<\/strong> <\/p>\n\n\n\n<p>Palash Dey, Neeldhara Misra, and Yadati Narahari. \u201cFrugal Bribery in Voting\u201d. <strong>Theoretical Computer Science<\/strong>, volume 676, pp. 15-32, May 2017. A preliminary version of this work appeared in Proc. <strong>30th AAAI Conference on Artificial Intelligence (AAAI-16)<\/strong>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In computational social choice, bribery refers to an external agent trying to influence the election outcome by persuading\u00a0 a certain targeted set of agents to vote in favor of some particular candidate. This work studies frugal bribers \u00a0who will persuade only those (vulnerable) voters who themselves also prefer the new election outcome that results if [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":5372,"menu_order":18,"comment_status":"closed","ping_status":"closed","template":"template-researchsnippets.php","meta":{"kt_blocks_editor_width":""},"acf":[],"_links":{"self":[{"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/pages\/5392"}],"collection":[{"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/comments?post=5392"}],"version-history":[{"count":6,"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/pages\/5392\/revisions"}],"predecessor-version":[{"id":5651,"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/pages\/5392\/revisions\/5651"}],"up":[{"embeddable":true,"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/pages\/5372"}],"wp:attachment":[{"href":"https:\/\/gtl.csa.iisc.ac.in\/hari\/wp-json\/wp\/v2\/media?parent=5392"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}