Complexity of safe manipulation under scoring rules

Ianovski, E; Yu, L; Elkind, E; Wilson, Mark

dc.contributor.author	Ianovski, E	en
dc.contributor.author	Yu, L	en
dc.contributor.author	Elkind, E	en
dc.contributor.author	Wilson, Mark	en
dc.contributor.editor	Walsh, Toby	en
dc.coverage.spatial	Barcelona, Spain	en
dc.date.accessioned	2013-11-29T00:28:04Z	en
dc.date.issued	2011	en
dc.identifier.citation	IJCAI 2011, Barcelona, Spain, 16 Jul 2011 - 22 Jul 2011. Editors: Walsh T. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. AAAI Press/International Joint Conferences on Artificial Intelligence, Menlo Park, California. 1: 246-251. 2011	en
dc.identifier.isbn	978-1-57735-516-8	en
dc.identifier.uri	http://hdl.handle.net/2292/21170	en
dc.description.abstract	Slinko and White, (2008) have recently introduced a new model of coalitional manipulation of voting rules under limited communication, which they call safe strategic voting. The computational aspects of this model were first studied by Hazon and Elkind, (2010), who provide polynomial-time algorithms for finding a safe strategic vote under k-approval and the Bucklin rule. In this paper, we answer an open question of Hazon and Elkind, (2010) by presenting a polynomial-time algorithm for finding a safe strategic vote under the Borda rule. Our results for Borda generalize to several interesting classes of scoring rules.	en
dc.publisher	AAAI Press/International Joint Conferences on Artificial Intelligence	en
dc.relation.ispartof	IJCAI 2011	en
dc.relation.ispartofseries	Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://ijcai.org/papers11/contents.php	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.title	Complexity of safe manipulation under scoring rules	en
dc.type	Conference Item	en
dc.identifier.doi	10.5591/978-1-57735-516-8/IJCAI11-052	en
pubs.begin-page	246	en
pubs.volume	1	en
pubs.end-page	251	en
pubs.finish-date	2011-07-22	en
pubs.place-of-publication	Menlo Park, California	en
pubs.publication-status	Accepted	en
pubs.start-date	2011-07-16	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/RestrictedAccess	en
pubs.subtype	Proceedings	en
pubs.elements-id	208924	en
pubs.org-id	Science	en
pubs.org-id	School of Computer Science	en
pubs.record-created-at-source-date	2011-04-13	en