{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:28:16Z","timestamp":1725424096183},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The \\textit{second-order Copeland} voting scheme is  NP-complete to manipulate even if a manipulator has perfect information about the preferences of other voters in an election.~A recent work proposes a \\textit{branch-and-bound} heuristic for manipulation of second-order Copeland elections.~The work shows that there are instances of the elections that may be manipulated using the branch-and-bound heuristic.~However, the performance of the heuristic degraded for fairly large number of candidates in elections.~We show that this  heuristic is \\textit{exponential} in the number of candidates in an election, and propose an improved heuristic that extends this previous work.~Our improved heuristic is based on \\textit{randomization technique} and is shown to be \\textit{polynomial} in the number of candidates in an election.~We also account for the number of samples required for a given accuracy and the  probability of missing the accurate value of the number of manipulations in an election.<\/jats:p>","DOI":"10.29007\/19q2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:06:01Z","timestamp":1516748761000},"page":"162-148","source":"Crossref","is-referenced-by-count":0,"title":["Improved Heuristic for Manipulation of Second-order Copeland Elections"],"prefix":"10.29007","volume":"50","author":[{"given":"Ramoni","family":"Lasisi","sequence":"first","affiliation":[]},{"given":"Abibat","family":"Lasisi","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"GCAI 2017. 3rd Global Conference on Artificial Intelligence"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:07:09Z","timestamp":1516748829000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/lVQF"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/19q2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}