Back to Results
First PageMeta Content
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

Document Date: 2014-12-04 03:20:52

Open Document

File Size: 201,88 KB

Share Result on Facebook

City

Toronto / Nanson / Sydney / /

Company

3SAT / /

Country

Australia / Netherlands / Canada / /

Currency

pence / /

Facility

University of Toronto / /

IndustryTerm

machinery / search engines / /

Organization

Australian Government / UNSW / ICT Centre of Excellence Program / Australian Research Council / University of Toronto / Senate / Department of Communications / /

Person

John Adams / Indeed John Adams / /

Position

chair / Vice Presidents / first Vice President / Speaker / /

ProvinceOrState

Copeland / /

PublishedMedium

Journal of the ACM / Theoretical Computer Science / Journal of Economic Perspectives / /

SportsEvent

NCAA / /

Technology

Universal voting protocol / Hybrid voting protocols / /

SocialTag