How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra

First Page		Document Content
Date: 2014-12-04 03:20:52 Political philosophy Social choice theory Electoral systems Voting systems Psephology Borda count Approval voting NP-complete NP-hard Single winner electoral systems Voting Complexity classes		How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra Add to Reading List Source URL: www.nickmattei.net Download Document from Source Website File Size: 201,88 KB Share Document on Facebook

	Some issues in verifying e-voting systems Mark D. Ryan ● Present-day e-voting offers few security properties [KohnoStubblefieldRubinWallach2004] compared to what is desirable: DocID: 1vp44 - View Document
	Annotated Bibliography of Expert Reports on Voting Systems Edited by Rady Ananda December 11, 2007 FAIR USE NOTICE: This paper contains copyrighted material the use of which has not always been specifically authorized by DocID: 1uFcG - View Document
	ISO TC20/SC14 Space Systems and Operations — U.S. Technical Advisory Group Participation Request Please check the appropriate box: I wish to be a Voting Member of the U.S. TAG. I agree to the following obligation DocID: 1uyuN - View Document
	GOVERNMENT F lorida’s voting systems were in the news again last month. A 10 September primary election marked DocID: 1uqnQ - View Document
	Formal Analysis of Electronic Voting Systems Mark Ryan University of Birmingham joint work with Ben Smyth Steve Kremer DocID: 1uknf - View Document