Follow
Arkadii Slinko
Arkadii Slinko
Department of Mathematics and Centre for Mathematics in Social Sciences, The University of Auckland
Verified email at auckland.ac.nz - Homepage
Title
Cited by
Cited by
Year
Rings that are nearly associative
IP Shestakov, AI Shirshov, AM Slin'ko, KA Zhevlakov
Academic Press, New York, 1982
1525*1982
Кольца, близкие к ассоциативным
АИ Жевлаков, К. А., Слинько А. М., Шестаков И. П., Ширшов
" Наукa", Главная редакция физико-математической литературы, 1978
1426*1978
Properties of multiwinner voting rules
E Elkind, P Faliszewski, P Skowron, A Slinko
Social Choice and Welfare 48 (3), 599-632, 2017
2522017
Multiwinner voting: A new challenge for social choice theory
P Faliszewski, P Skowron, A Slinko, N Talmon
Trends in computational social choice 74 (2017), 27-47, 2017
2302017
Degree spectra and computable dimensions in algebraic structures
DR Hirschfeldt, B Khoussainov, RA Shore, AM Slinko
Annals of Pure and Applied Logic 115 (1-3), 71-113, 2002
2182002
On the Computation of Fully Proportional Representation
N Betzler, A Slinko, J Uhlmann
Journal of Artificial IIntelligence Research 47, 475-519, 2013
1992013
Achieving Fully Proportional Representation: Approximability Results
P Skowron, P Faliszewski, A Slinko
Artificial Intelligence 222, 67 - 103, 2015
146*2015
Swap bribery
E Elkind, P Faliszewski, A Slinko
Algorithmic Game Theory, 299-310, 2009
1412009
On complexity of lobbying in multiple referenda
R Christian, M Fellows, F Rosamond, A Slinko
Review of Economic Design 11 (3), 217-224, 2007
902007
Clone structures in voters' preferences
E Elkind, P Faliszewski, A Slinko
Proceedings of the 13th ACM conference on electronic commerce, 496-513, 2012
822012
Committee scoring rules: Axiomatic characterization and hierarchy
P Faliszewski, P Skowron, A Slinko, N Talmon
ACM Transactions on Economics and Computation (TEAC) 7 (1), 1-39, 2019
74*2019
Approximability of Dodgson’s rule
JC McCabe-Dansted, G Pritchard, A Slinko
Social Choice and Welfare 31 (2), 311-330, 2008
692008
Rationalizations of Condorcet-consistent rules via distances of Hamming type
E Elkind, P Faliszewski, A Slinko
Social Choice and Welfare, 1-15, 2010
67*2010
What do multiwinner voting rules do? An experiment over the two-dimensional Euclidean domain
E Elkind, P Faliszewski, JF Laslier, P Skowron, A Slinko, N Talmon
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
592017
On the role of distances in defining voting rules.
E Elkind, P Faliszewski, AM Slinko
AAMAS 10, 375-382, 2010
532010
Is it ever safe to vote strategically?
A Slinko, S White
Social Choice and Welfare 43 (2), 403-427, 2014
50*2014
Cloning in Elections: Finding the Possible Winners
E Elkind, P Faliszewski, A Slinko
Journal of Artificial Intelligence Research 42, 529-573, 2011
482011
Multiwinner analogues of the plurality rule: Axiomatic and algorithmic perspectives
P Faliszewski, P Skowron, A Slinko, N Talmon
Social Choice and Welfare 51 (3), 513-550, 2018
472018
Axiomatic characterization of committee scoring rules
P Skowron, P Faliszewski, A Slinko
Journal of Economic Theory 180, 244-273, 2019
462019
On distance rationalizability of some voting rules
E Elkind, P Faliszewski, A Slinko
Proceedings of the 12th conference on theoretical aspects of rationality and …, 2009
462009
The system can't perform the operation now. Try again later.
Articles 1–20