Degree spectra and computable dimensions in algebraic structures. - Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore; Arkadii M. Slinko (Ann. Pure Appl. Log., 2002)

On asymptotic strategy-proofness of the plurality and the run-off rules. - Arkadii Slinko (Soc. Choice Welf., 2002)

How large should a coalition be to manipulate an election? - Arkadii Slinko (Math. Soc. Sci., 2004)

Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings. - Robin Christian; Arkadii M. Slinko (ISIPTA, 2005)

On the Average Minimum Size of a Manipulating Coalition. - Geoffrey Pritchard; Arkadii M. Slinko (Soc. Choice Welf., 2006)

How the size of a coalition affects its chances to influence an election. - Arkadii Slinko (Soc. Choice Welf., 2006)

Flippable Pairs and Subset Comparisons in Comparative Probability Orderings. - Robin Christian; Marston D. E. Conder; Arkadii M. Slinko (Order, 2007)

Orders on Multisets and Discrete Cones. - Marston D. E. Conder; Simon Marshall; Arkadii M. Slinko (Order, 2007)

Self-selective social choice functions. - Semih Koray; Arkadii Slinko (Soc. Choice Welf., 2008)

Approximability of Dodgson's rule. - John Christopher McCabe-Dansted; Geoffrey Pritchard; Arkadii M. Slinko (Soc. Choice Welf., 2008)

Additive Representability of Finite Measurement Structures. - Arkadii Slinko (The Mathematics of Preference, Choice and Order, 2009)

Axioms for a Class of Algorithms of Sequential Decision Making. - Murali Agastya; Arkadii M. Slinko (ADT, 2009)

Swap Bribery. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (SAGT, 2009)

On distance rationalizability of some voting rules. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (TARK, 2009)

Orders on Subsets Rationalised by Abstract Convex Geometries. - Walter Bossert; Matthew J. Ryan; Arkadii Slinko (Order, 2009)

Cloning in Elections. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (AAAI, 2010)

Good Rationalizations of Voting Rules. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (AAAI, 2010)

On the role of distances in defining voting rules. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (AAMAS, 2010)

Homogeneity and monotonicity of distance-rationalizable voting rules. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (AAMAS, 2011)

Cloning in Elections: Finding the Possible Winners. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (J. Artif. Intell. Res., 2011)

Weighted and roughly weighted simple games. - Tatiana Gvozdeva; Arkadii M. Slinko (Math. Soc. Sci., 2011)

Clone structures in voters' preferences. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (EC, 2012)

Proportional Representation as Resource Allocation: Approximability Results - Piotr Krzysztof Skowron; Piotr Faliszewski; Arkadii M. Slinko (CoRR, 2012)

Rationalizations of Condorcet-consistent rules via distances of hamming type. - Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (Soc. Choice Welf., 2012)

On swap-distance geometry of voting rules. - Svetlana Obraztsova; Edith Elkind; Piotr Faliszewski; Arkadii M. Slinko (AAMAS, 2013)

Achieving fully proportional representation is easy in practice. - Piotr Krzysztof Skowron; Piotr Faliszewski; Arkadii M. Slinko (AAMAS, 2013)

Fully Proportional Representation as Resource Allocation: Approximability Results. - Piotr Krzysztof Skowron; Piotr Faliszewski; Arkadii M. Slinko (IJCAI, 2013)

A Characterization of Ideal Weighted Secret Sharing Schemes. - Ali Hameed; Arkadii M. Slinko (CoRR, 2013)

Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality - Dodge Cahan; John Christopher McCabe-Dansted; Arkadii M. Slinko (CoRR, 2013)

Three hierarchies of simple games parameterized by "resource" parameters. - Tatiana Gvozdeva; Lane A. Hemaspaandra; Arkadii M. Slinko (Int. J. Game Theory, 2013)

On the Computation of Fully Proportional Representation. - Nadja Betzler; Arkadii Slinko; Johannes Uhlmann (J. Artif. Intell. Res., 2013)

Weightedness and structural characterization of hierarchical simple games. - Tatiana Gvozdeva; Ali Hameed; Arkadii M. Slinko (Math. Soc. Sci., 2013)

On the Number of Facets of Polytopes Representing Comparative Probability Orders. - Ilya Chevyrev; Dominic Searles; Arkadii Slinko (Order, 2013)

Simplicial Complexes Obtained from Qualitative Probability Orders. - Paul H. Edelman; Tatiana Gvozdeva; Arkadii M. Slinko (SIAM J. Discret. Math., 2013)

The single-crossing property on a tree. - Adam Clearwater; Clemens Puppe; Arkadii Slinko (CoRR, 2014)

Is it ever safe to vote strategically? - Arkadii Slinko; Shaun White (Soc. Choice Welf., 2014)

Algebra for Applications - Cryptography, Secret Sharing, Error-Correcting, Fingerprinting, Compression. - Arkadii Slinko (Springer, 2015)

Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs. - Adam Clearwater; Clemens Puppe; Arkadii Slinko (IJCAI, 2015)

Gibbard-Satterthwaite Games. - Edith Elkind; Umberto Grandi; Francesca Rossi 001; Arkadii Slinko (IJCAI, 2015)

Achieving fully proportional representation: Approximability results. - Piotr Skowron 001; Piotr Faliszewski; Arkadii M. Slinko (Artif. Intell., 2015)

Condorcet Domains, Median Graphs and the Single Crossing Property. - Clemens Puppe; Arkadii M. Slinko (CoRR, 2015)

Roughly weighted hierarchical simple games. - Ali Hameed; Arkadii Slinko (Int. J. Game Theory, 2015)

Dynamic choice in a complex world. - Murali Agastya; Arkadii Slinko (J. Econ. Theory, 2015)

A characterisation of ideal weighted secret sharing schemes. - Ali Hameed; Arkadii Slinko (J. Math. Cryptol., 2015)

Distance rationalization of voting rules. - Edith Elkind; Piotr Faliszewski; Arkadii Slinko (Soc. Choice Welf., 2015)

Committee Scoring Rules: Axiomatic Classification and Hierarchy. - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (IJCAI, 2016)

Voting-Based Group Formation. - Piotr Faliszewski; Arkadii M. Slinko; Nimrod Talmon (IJCAI, 2016)

Modeling Representation of Minorities Under Multiwinner Voting Rules. - Piotr Faliszewski; Jean-François Laslier; Robert Schaefer; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (CoRR, 2016)

Rationalizations of Voting Rules. - Edith Elkind; Arkadii Slinko (Handbook of Computational Social Choice, 2016)

What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. - Edith Elkind; Piotr Faliszewski; Jean-François Laslier; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (AAAI, 2017)

Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. - Jérôme Lang; Jérôme Monnot; Arkadii Slinko; William S. Zwicker (AAMAS, 2017)

Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (IJCAI, 2017)

Cognitive Hierarchy and Voting Manipulation. - Edith Elkind; Umberto Grandi; Francesca Rossi 001; Arkadii Slinko (CoRR, 2017)

The Complexity of Multiwinner Voting Rules with Variable Number of Winners. - Piotr Faliszewski; Arkadii Slinko; Nimrod Talmon (CoRR, 2017)

Growth of dimension in complete simple games. - Liam O'Dwyer; Arkadii Slinko (Math. Soc. Sci., 2017)

Properties of multiwinner voting rules. - Edith Elkind; Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko (Soc. Choice Welf., 2017)

Egalitarian Committee Scoring Rules. - Haris Aziz 001; Piotr Faliszewski; Bernard Grofman; Arkadii Slinko; Nimrod Talmon (IJCAI, 2018)

Achieving fully proportional representation by clustering voters. - Piotr Faliszewski; Arkadii Slinko; Kolja Stahl; Nimrod Talmon (J. Heuristics, 2018)

Electoral competition under best-worst voting rules. - Dodge Cahan; Arkadii Slinko (Soc. Choice Welf., 2018)

Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (Soc. Choice Welf., 2018)

How Similar Are Two Elections? - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Stanislaw Szufa; Nimrod Talmon (AAAI, 2019)

Realistic versus Rational Secret Sharing. - Yvo Desmedt; Arkadii Slinko (GameSec, 2019)

Operations over Linear Secret Sharing Schemes. - Arkadii Slinko (GameSec, 2019)

Axiomatic characterization of committee scoring rules. - Piotr Skowron 001; Piotr Faliszewski; Arkadii Slinko (J. Econ. Theory, 2019)

Mixing discount functions: Implications for collective time preferences. - Nina Anchugina; Matthew J. Ryan; Arkadii Slinko (Math. Soc. Sci., 2019)

Gibbard-Satterthwaite games for k-approval voting rules. - Umberto Grandi; Daniel Hughes 003; Francesca Rossi 001; Arkadii Slinko (Math. Soc. Sci., 2019)

Committee Scoring Rules: Axiomatic Characterization and Hierarchy. - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (ACM Trans. Economics and Comput., 2019)

Drawing a Map of Elections in the Space of Statistical Cultures. - Stanislaw Szufa; Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (AAMAS, 2020)

Isomorphic Distances Among Elections. - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Stanislaw Szufa; Nimrod Talmon (CSR, 2020)

Multiwinner Rules with Variable Number of Winners. - Piotr Faliszewski; Arkadii Slinko; Nimrod Talmon (ECAI, 2020)

Participatory Budgeting with Cumulative Votes. - Piotr Skowron 001; Arkadii Slinko; Stanislaw Szufa; Nimrod Talmon (CoRR, 2020)

Ways to merge two secret sharing schemes. - Arkadii Slinko (IET Inf. Secur., 2020)

Cognitive hierarchy and voting manipulation in k-approval voting. - Edith Elkind; Umberto Grandi; Francesca Rossi 001; Arkadii Slinko (Math. Soc. Sci., 2020)

Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm. - Dodge Cahan; Hongjia H. Chen; Louis Christie; Arkadii Slinko (Int. J. Game Theory, 2021)

Towards a classification of maximal peak-pit Condorcet domains. - Guanhao Li; Clemens Puppe; Arkadii Slinko (Math. Soc. Sci., 2021)

Framing in Secret Sharing. - Yvo Desmedt; Songbao Mo; Arkadii M. Slinko (IEEE Trans. Inf. Forensics Secur., 2021)

How to Sample Approval Elections? - Stanislaw Szufa; Piotr Faliszewski; Lukasz Janeczko; Martin Lackner; Arkadii Slinko; Krzysztof Sornat; Nimrod Talmon (IJCAI, 2022)

Symmetric Maximal Condorcet Domains. - Alexander Karpov; Arkadii Slinko (Order, 2023)

Maximal Condorcet domains. A further progress report. - Clemens Puppe; Arkadii Slinko (Games Econ. Behav., 2024)

Note on "A classification of peak-pit maximal Condorcet domains" by Guanhao Li, Mathematical Social Sciences 125 (2023), 42-57. - Clemens Puppe; Arkadii Slinko (Math. Soc. Sci., 2024)

A family of condorcet domains that are single-peaked on a circle. - Arkadii Slinko (Soc. Choice Welf., 2024)

Drawing a map of elections. - Stanislaw Szufa; Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (Artif. Intell., 2025)

How similar are two elections? - Piotr Faliszewski; Piotr Skowron 001; Arkadii Slinko; Krzysztof Sornat; Stanislaw Szufa; Nimrod Talmon (J. Comput. Syst. Sci., 2025)