Sciweavers

16 search results - page 1 / 4
» How Hard is Bribery in Party Based Elections
Sort
View
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 4 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
IWPEC
2010
Springer
13 years 2 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter
AAAI
2010
13 years 6 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
COMPUTER
2002
91views more  COMPUTER 2002»
13 years 4 months ago
Representative Democracy and the Profession
the term refers in an abstract way to a process or institution under which government openly solicits, preserves, and fosters information about its citizens' interests. At the...
W. Neville Holmes
SCN
2008
Springer
13 years 4 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström