default search action
Arkadii M. Slinko
Arkadii Slinko
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j42]Clemens Puppe, Arkadii Slinko:
Maximal Condorcet domains. A further progress report. Games Econ. Behav. 145: 426-450 (2024) - [j41]Clemens Puppe, Arkadii Slinko:
Note on "A classification of peak-pit maximal Condorcet domains" by Guanhao Li, Mathematical Social Sciences 125 (2023), 42-57. Math. Soc. Sci. 128: 16-17 (2024) - [j40]Arkadii Slinko
:
A family of condorcet domains that are single-peaked on a circle. Soc. Choice Welf. 63(1): 57-67 (2024) - 2023
- [j39]Alexander Karpov, Arkadii Slinko
Symmetric Maximal Condorcet Domains. Order 40(2): 289-309 (2023) - 2022
- [c30]Stanislaw Szufa
How to Sample Approval Elections? IJCAI 2022: 496-502 - [i29]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - 2021
- [j38]Dodge Cahan, Hongjia H. Chen, Louis Christie, Arkadii Slinko:
Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm. Int. J. Game Theory 50(4): 945-970 (2021) - [j37]Guanhao Li
Towards a classification of maximal peak-pit Condorcet domains. Math. Soc. Sci. 113: 191-202 (2021) - [j36]Yvo Desmedt
Framing in Secret Sharing. IEEE Trans. Inf. Forensics Secur. 16: 2836-2842 (2021) - 2020
- [j35]Arkadii Slinko:
Ways to merge two secret sharing schemes. IET Inf. Secur. 14(1): 146-150 (2020) - [j34]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko
Cognitive hierarchy and voting manipulation in k-approval voting. Math. Soc. Sci. 108: 193-205 (2020) - [c29]Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a Map of Elections in the Space of Statistical Cultures. AAMAS 2020: 1341-1349 - [c28]Piotr Faliszewski
Isomorphic Distances Among Elections. CSR 2020: 64-78 - [c27]Piotr Faliszewski
Multiwinner Rules with Variable Number of Winners. ECAI 2020: 67-74 - [i28]Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting with Cumulative Votes. CoRR abs/2009.02690 (2020)
2010 – 2019
- 2019
- [j33]Piotr Skowron
Axiomatic characterization of committee scoring rules. J. Econ. Theory 180: 244-273 (2019) - [j32]Umberto Grandi, Daniel Hughes, Francesca Rossi, Arkadii Slinko
Gibbard-Satterthwaite games for k-approval voting rules. Math. Soc. Sci. 99: 24-35 (2019) - [j31]Nina Anchugina, Matthew J. Ryan, Arkadii Slinko:
Mixing discount functions: Implications for collective time preferences. Math. Soc. Sci. 102: 1-14 (2019) - [j30]Piotr Faliszewski
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. ACM Trans. Economics and Comput. 7(1): 3:1-3:39 (2019) - [c26]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
How Similar Are Two Elections? AAAI 2019: 1909-1916 - [c25]Yvo Desmedt, Arkadii Slinko:
Realistic versus Rational Secret Sharing. GameSec 2019: 152-163 - [c24]Arkadii Slinko:
Operations over Linear Secret Sharing Schemes. GameSec 2019: 513-524 - [i27]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - [i26]Yvo Desmedt, Arkadii Slinko:
Realistic versus Rational Secret Sharing. CoRR abs/1908.07581 (2019) - 2018
- [j29]Piotr Faliszewski
Achieving fully proportional representation by clustering voters. J. Heuristics 24(5): 725-756 (2018) - [j28]Dodge Cahan, Arkadii Slinko:
Electoral competition under best-worst voting rules. Soc. Choice Welf. 51(2): 259-279 (2018) - [j27]Piotr Faliszewski
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3): 513-550 (2018) - [c23]Haris Aziz
Egalitarian Committee Scoring Rules. IJCAI 2018: 56-62 - [i25]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. CoRR abs/1802.06483 (2018) - 2017
- [j26]Liam O'Dwyer, Arkadii Slinko:
Growth of dimension in complete simple games. Math. Soc. Sci. 90: 2-8 (2017) - [j25]Edith Elkind, Piotr Faliszewski
Properties of multiwinner voting rules. Soc. Choice Welf. 48(3): 599-632 (2017) - [c22]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c21]Jérôme Lang, Jérôme Monnot, Arkadii Slinko, William S. Zwicker:
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS 2017: 24-32 - [c20]Piotr Faliszewski
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. IJCAI 2017: 192-198 - [i24]Umberto Grandi, Daniel Hughes, Francesca Rossi, Arkadii Slinko:
Gibbard-Satterthwaite Games for k-Approval Voting Rules. CoRR abs/1707.05619 (2017) - [i23]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko:
Cognitive Hierarchy and Voting Manipulation. CoRR abs/1707.08598 (2017) - [i22]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
The Complexity of Multiwinner Voting Rules with Variable Number of Winners. CoRR abs/1711.06641 (2017) - 2016
- [c19]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI 2016: 482-488 - [c18]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving Fully Proportional Representation by Clustering Voters. AAMAS 2016: 296-304 - [c17]Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. IJCAI 2016: 243-249 - [c16]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. IJCAI 2016: 250-256 - [r1]Edith Elkind, Arkadii Slinko:
Rationalizations of Voting Rules. Handbook of Computational Social Choice 2016: 169-196 - [i21]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR abs/1602.08687 (2016) - [i20]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Axiomatic Characterization of Committee Scoring Rules. CoRR abs/1604.01529 (2016) - [i19]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - [i18]Liam O'Dwyer, Arkadii Slinko:
Growth of Dimension in Complete Simple Games. CoRR abs/1605.05114 (2016) - [i17]Dodge Cahan, Arkadii Slinko:
Electoral Competition under Best-Worst Voting Rules. CoRR abs/1610.02787 (2016) - 2015
- [b1]Arkadii Slinko
Algebra for Applications - Cryptography, Secret Sharing, Error-Correcting, Fingerprinting, Compression. Springer undergraduate mathematics series, Springer 2015, ISBN 978-3-319-21950-9, pp. I-XIV, 1-328 - [j24]Piotr Skowron
Achieving fully proportional representation: Approximability results. Artif. Intell. 222: 67-103 (2015) - [j23]Ali Hameed, Arkadii Slinko
Roughly weighted hierarchical simple games. Int. J. Game Theory 44(2): 295-319 (2015) - [j22]Murali Agastya
Dynamic choice in a complex world. J. Econ. Theory 158: 232-258 (2015) - [j21]Ali Hameed, Arkadii Slinko:
A characterisation of ideal weighted secret sharing schemes. J. Math. Cryptol. 9(4): 227-244 (2015) - [j20]Edith Elkind, Piotr Faliszewski
Distance rationalization of voting rules. Soc. Choice Welf. 45(2): 345-377 (2015) - [c15]Adam Clearwater, Clemens Puppe, Arkadii Slinko:
Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs. IJCAI 2015: 32-38 - [c14]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko:
Gibbard-Satterthwaite Games. IJCAI 2015: 533-539 - [i16]Adam Clearwater, Clemens Puppe, Arkadii Slinko:
Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs. CoRR abs/1505.06982 (2015) - [i15]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko:
Properties of Multiwinner Voting Rules. CoRR abs/1506.02891 (2015) - [i14]Clemens Puppe, Arkadii M. Slinko:
Condorcet Domains, Median Graphs and the Single Crossing Property. CoRR abs/1507.08219 (2015) - 2014
- [j19]Arkadii Slinko
Is it ever safe to vote strategically? Soc. Choice Welf. 43(2): 403-427 (2014) - [c13]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. AAMAS 2014: 53-60 - [i13]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Cloning in Elections: Finding the Possible Winners. CoRR abs/1401.4602 (2014) - [i12]Nadja Betzler, Arkadii Slinko, Johannes Uhlmann:
On the Computation of Fully Proportional Representation. CoRR abs/1402.0580 (2014) - [i11]Adam Clearwater, Clemens Puppe, Arkadii Slinko:
The single-crossing property on a tree. CoRR abs/1410.2272 (2014) - 2013
- [j18]Tatiana Gvozdeva, Lane A. Hemaspaandra
Three hierarchies of simple games parameterized by "resource" parameters. Int. J. Game Theory 42(1): 1-17 (2013) - [j17]Nadja Betzler, Arkadii Slinko
On the Computation of Fully Proportional Representation. J. Artif. Intell. Res. 47: 475-519 (2013) - [j16]Tatiana Gvozdeva, Ali Hameed, Arkadii M. Slinko
Weightedness and structural characterization of hierarchical simple games. Math. Soc. Sci. 65(3): 181-189 (2013) - [j15]Ilya Chevyrev
On the Number of Facets of Polytopes Representing Comparative Probability Orders. Order 30(3): 749-761 (2013) - [j14]Paul H. Edelman
Simplicial Complexes Obtained from Qualitative Probability Orders. SIAM J. Discret. Math. 27(4): 1820-1843 (2013) - [c12]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c11]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving fully proportional representation is easy in practice. AAMAS 2013: 399-406 - [c10]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Fully Proportional Representation as Resource Allocation: Approximability Results. IJCAI 2013: 353-359 - [i10]Dodge Cahan, John Christopher McCabe-Dansted, Arkadii M. Slinko:
Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality. CoRR abs/1301.0152 (2013) - [i9]Arkadii M. Slinko, Shaun White:
Is it ever safe to vote strategically? CoRR abs/1301.1420 (2013) - [i8]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation is Easy in Practice. CoRR abs/1301.6400 (2013) - [i7]Ali Hameed, Arkadii M. Slinko:
A Characterization of Ideal Weighted Secret Sharing Schemes. CoRR abs/1308.3763 (2013) - [i6]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation: Approximability Results. CoRR abs/1312.4026 (2013) - 2012
- [j13]Edith Elkind, Piotr Faliszewski
Rationalizations of Condorcet-consistent rules via distances of hamming type. Soc. Choice Welf. 39(4): 891-905 (2012) - [c9]Edith Elkind, Piotr Faliszewski
Clone structures in voters' preferences. EC 2012: 496-513 - [i5]Ali Hameed, Arkadii M. Slinko:
Roughly Weighted Hierarchical Simple Games. CoRR abs/1205.2152 (2012) - [i4]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Proportional Representation as Resource Allocation: Approximability Results. CoRR abs/1208.1661 (2012) - 2011
- [j12]Edith Elkind, Piotr Faliszewski
Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. 42: 529-573 (2011) - [j11]Tatiana Gvozdeva, Arkadii M. Slinko
Weighted and roughly weighted simple games. Math. Soc. Sci. 61(1): 20-30 (2011) - [c8]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 - [i3]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011) - 2010
- [c7]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections. AAAI 2010: 768-773 - [c6]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. AAAI 2010: 774-779 - [c5]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On the role of distances in defining voting rules. AAMAS 2010: 375-382 - [i2]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. CoRR abs/1009.0300 (2010)
2000 – 2009
- 2009
- [j10]Walter Bossert, Matthew J. Ryan, Arkadii Slinko
Orders on Subsets Rationalised by Abstract Convex Geometries. Order 26(3): 237-244 (2009) - [c4]Murali Agastya
Axioms for a Class of Algorithms of Sequential Decision Making. ADT 2009: 353-364 - [c3]Edith Elkind, Piotr Faliszewski
Swap Bribery. SAGT 2009: 299-310 - [c2]Edith Elkind, Piotr Faliszewski
On distance rationalizability of some voting rules. TARK 2009: 108-117 - [p1]Arkadii Slinko
Additive Representability of Finite Measurement Structures. The Mathematics of Preference, Choice and Order 2009: 113-133 - [i1]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. CoRR abs/0905.3885 (2009) - 2008
- [j9]Semih Koray, Arkadii Slinko
Self-selective social choice functions. Soc. Choice Welf. 31(1): 129-149 (2008) - [j8]John Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko
Approximability of Dodgson's rule. Soc. Choice Welf. 31(2): 311-330 (2008) - 2007
- [j7]Robin Christian, Marston D. E. Conder
Flippable Pairs and Subset Comparisons in Comparative Probability Orderings. Order 24(3): 193-213 (2007) - [j6]Marston D. E. Conder
Orders on Multisets and Discrete Cones. Order 24(4): 277-296 (2007) - 2006
- [j5]Arkadii Slinko
How the size of a coalition affects its chances to influence an election. Soc. Choice Welf. 26(1): 143-153 (2006) - [j4]Geoffrey Pritchard, Arkadii M. Slinko
On the Average Minimum Size of a Manipulating Coalition. Soc. Choice Welf. 27(2): 263-277 (2006) - 2005
- [c1]Robin Christian, Arkadii M. Slinko:
Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings. ISIPTA 2005: 117-124 - 2004
- [j3]Arkadii Slinko:
How large should a coalition be to manipulate an election? Math. Soc. Sci. 47(3): 289-293 (2004) - 2002
- [j2]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko
Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Log. 115(1-3): 71-113 (2002) - [j1]Arkadii Slinko:
On asymptotic strategy-proofness of the plurality and the run-off rules. Soc. Choice Welf. 19(2): 313-324 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: