activity
20072014
most citedControl Complexity in Fallback Voting

35 citations · 111 across the 12 of their papers we have counts for

collaborators

12 papers

cs.GT2014★ 5 cited

More Natural Models of Electoral Control by Partition

Gabor Erdelyi, Edith Hemaspaandra, Lane A. Hemaspaandra

"Control" studies attempts to set the outcome of elections through the addition, deletion, or partition of voters or candidates. The set of benchmark control types was largely set…

cs.CC2012★ 21 cited

Computational Aspects of Nearly Single-Peaked Electorates

Gábor Erdélyi, Martin Lackner, Andreas Pfandler

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of th…

cs.CC2011★ 13 cited

Control Complexity in Bucklin and Fallback Voting

Gábor Erdélyi, Michael Fellows, Jörg Rothe +1

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. To protect elections from such co…

cs.CC2010★ 11 cited

Bucklin Voting is Broadly Resistant to Control

Gábor Erdélyi, Lena Piras, Jörg Rothe

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election'…

cs.CC2010★ 1 cited

Parameterized Control Complexity in Fallback Voting

Gábor Erdélyi, Michael Fellows

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different wa…

cs.GT2010★ 35 cited

Control Complexity in Fallback Voting

Gábor Erdélyi, Lena Piras, Jörg Rothe

We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or b…