{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T22:24:33Z","timestamp":1699914273701},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643684369","type":"print"},{"value":"9781643684376","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,28]]},"abstract":"<jats:p>Determining the complexity of election attack problems is a major research direction in the computational study of voting problems. The paper \u201cTowards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters\u201d by Erd\u00e9lyi et al. (JAAMAS 2021) provides a comprehensive study of the complexity of control problems. The sole open problem is constructive control by replacing voters for 2-Approval. We show that this case is in P, strengthening the recent RP (randomized polynomial-time) upper bound due to Fitzsimmons and Hemaspaandra (IJCAI 2022). We show this by transforming 2-Approval CCRV to weighted matching. We also use this approach to show that priced bribery for 2-Veto elections is in P. With this result, and the accompanying (unsurprising) result that priced bribery for 3-Veto elections is NP-complete, this settles the complexity for k-Approval and k-Veto standard control and bribery cases.<\/jats:p>","DOI":"10.3233\/faia230338","type":"book-chapter","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:09:04Z","timestamp":1695978544000},"source":"Crossref","is-referenced-by-count":1,"title":["Using Weighted Matching to Solve 2-Approval\/Veto Control and Bribery"],"prefix":"10.3233","author":[{"given":"Zack","family":"Fitzsimmons","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, MA 01610 USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rochester Institute of Technology, Rochester, NY 14623 USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2023"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA230338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:09:06Z","timestamp":1695978546000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"ISBN":["9781643684369","9781643684376"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230338","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,28]]}}}