122 citations · 256 across the 36 of their papers we have counts for
5 papers · 1 filter
Achieving Fully Proportional Representation: Approximability Results
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optim…
A Characterization of Ideal Weighted Secret Sharing Schemes
Ali Hameed, Arkadii Slinko
Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially characterized access structures of ideal weighted threshold secret sharing schemes in terms of the operation…
Achieving Fully Proportional Representation is Easy in Practice
Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both o…
Is it ever safe to vote strategically?
Arkadii Slinko, Shaun White
There are many situations in which mis-coordinated strategic voting can leave strategic voters worse off than they would have been had they not tried to strategize. We analyse the…
Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality
Dodge Cahan, John McCabe-Dansted, Arkadii Slinko
We use Hotelling's spatial model of competition to investigate the position-taking behaviour of political candidates under a class of electoral systems known as scoring rules. In a…