Arkadii M. Slinko

According to our database1, Arkadii M. Slinko authored at least 70 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Ways to merge two secret sharing schemes.
IET Information Security, 2020

Isomorphic Distances Among Elections.
Proceedings of the Computer Science - Theory and Applications, 2020

Drawing a Map of Elections in the Space of Statistical Cultures.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Committee Scoring Rules: Axiomatic Characterization and Hierarchy.
ACM Trans. Economics and Comput., 2019

Gibbard-Satterthwaite games for k-approval voting rules.
Math. Soc. Sci., 2019

Mixing discount functions: Implications for collective time preferences.
Math. Soc. Sci., 2019

Axiomatic characterization of committee scoring rules.
J. Econ. Theory, 2019

Operations over Linear Secret Sharing Schemes.
Proceedings of the Decision and Game Theory for Security - 10th International Conference, 2019

Realistic versus Rational Secret Sharing.
Proceedings of the Decision and Game Theory for Security - 10th International Conference, 2019

How Similar Are Two Elections?
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives.
Soc. Choice Welf., 2018

Electoral competition under best-worst voting rules.
Soc. Choice Welf., 2018

Achieving fully proportional representation by clustering voters.
J. Heuristics, 2018

Egalitarian Committee Scoring Rules.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Properties of multiwinner voting rules.
Soc. Choice Welf., 2017

Growth of dimension in complete simple games.
Math. Soc. Sci., 2017

The Complexity of Multiwinner Voting Rules with Variable Number of Winners.
CoRR, 2017

Cognitive Hierarchy and Voting Manipulation.
CoRR, 2017

Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Rationalizations of Voting Rules.
Proceedings of the Handbook of Computational Social Choice, 2016

Modeling Representation of Minorities Under Multiwinner Voting Rules.
CoRR, 2016

Voting-Based Group Formation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Committee Scoring Rules: Axiomatic Classification and Hierarchy.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Distance rationalization of voting rules.
Soc. Choice Welf., 2015

A characterisation of ideal weighted secret sharing schemes.
J. Mathematical Cryptology, 2015

Dynamic choice in a complex world.
J. Econ. Theory, 2015

Roughly weighted hierarchical simple games.
Int. J. Game Theory, 2015

Condorcet Domains, Median Graphs and the Single Crossing Property.
CoRR, 2015

Achieving fully proportional representation: Approximability results.
Artif. Intell., 2015

Gibbard-Satterthwaite Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Algebra for Applications - Cryptography, Secret Sharing, Error-Correcting, Fingerprinting, Compression.
Springer undergraduate mathematics series, Springer, ISBN: 978-3-319-21950-9, 2015

2014
Is it ever safe to vote strategically?
Soc. Choice Welf., 2014

The single-crossing property on a tree.
CoRR, 2014

2013
Simplicial Complexes Obtained from Qualitative Probability Orders.
SIAM J. Discret. Math., 2013

On the Number of Facets of Polytopes Representing Comparative Probability Orders.
Order, 2013

Weightedness and structural characterization of hierarchical simple games.
Math. Soc. Sci., 2013

On the Computation of Fully Proportional Representation.
J. Artif. Intell. Res., 2013

Three hierarchies of simple games parameterized by "resource" parameters.
Int. J. Game Theory, 2013

Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality
CoRR, 2013

A Characterization of Ideal Weighted Secret Sharing Schemes.
CoRR, 2013

Fully Proportional Representation as Resource Allocation: Approximability Results.
Proceedings of the IJCAI 2013, 2013

Achieving fully proportional representation is easy in practice.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

On swap-distance geometry of voting rules.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Rationalizations of Condorcet-consistent rules via distances of hamming type.
Soc. Choice Welf., 2012

Proportional Representation as Resource Allocation: Approximability Results
CoRR, 2012

Clone structures in voters' preferences.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Weighted and roughly weighted simple games.
Math. Soc. Sci., 2011

Cloning in Elections: Finding the Possible Winners.
J. Artif. Intell. Res., 2011

Homogeneity and monotonicity of distance-rationalizable voting rules.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
On the role of distances in defining voting rules.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Good Rationalizations of Voting Rules.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Cloning in Elections.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Orders on Subsets Rationalised by Abstract Convex Geometries.
Order, 2009

On distance rationalizability of some voting rules.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

Swap Bribery.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Axioms for a Class of Algorithms of Sequential Decision Making.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Additive Representability of Finite Measurement Structures.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008
Approximability of Dodgson's rule.
Soc. Choice Welf., 2008

Self-selective social choice functions.
Soc. Choice Welf., 2008

2007
Orders on Multisets and Discrete Cones.
Order, 2007

Flippable Pairs and Subset Comparisons in Comparative Probability Orderings.
Order, 2007

2006
How the size of a coalition affects its chances to influence an election.
Soc. Choice Welf., 2006

On the Average Minimum Size of a Manipulating Coalition.
Soc. Choice Welf., 2006

2005
Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings.
Proceedings of the ISIPTA '05, 2005

2004
How large should a coalition be to manipulate an election?
Math. Soc. Sci., 2004

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

Degree spectra and computable dimensions in algebraic structures.
Ann. Pure Appl. Log., 2002


  Loading...