Arkadii M. Slinko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2021

Framing in Secret SharingYvo Desmedt, Songbao Mo, Arkadii M. Slinko. tifs, 16:2836-2842, 2021. [doi]

2016

Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic PerspectivesPiotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon. AAAI 2016: 482-488 [doi]

Voting-Based Group FormationPiotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon. IJCAI 2016: 243-249 [doi]

2015

Achieving fully proportional representation: Approximability resultsPiotr Skowron, Piotr Faliszewski, Arkadii M. Slinko. ai, 222:67-103, 2015. [doi]

2013

Simplicial Complexes Obtained from Qualitative Probability OrdersPaul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko. siamdm, 27(4):1820-1843, 2013. [doi]

Weightedness and structural characterization of hierarchical simple gamesTatiana Gvozdeva, Ali Hameed, Arkadii M. Slinko. mss, 65(3):181-189, 2013. [doi]

Three hierarchies of simple games parameterized by "resource" parametersTatiana Gvozdeva, Lane A. Hemaspaandra, Arkadii M. Slinko. ijgt, 42(1):1-17, 2013. [doi]

On swap-distance geometry of voting rulesSvetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko. atal 2013: 383-390 [doi]

Achieving fully proportional representation is easy in practicePiotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko. atal 2013: 399-406 [doi]

Fully Proportional Representation as Resource Allocation: Approximability ResultsPiotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko. IJCAI 2013: 353-359 [doi]

2012

Clone structures in voters' preferencesEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. sigecom 2012: 496-513 [doi]

Rationalizations of Condorcet-consistent rules via distances of hamming typeEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. scw, 39(4):891-905, 2012. [doi]

2011

Homogeneity and monotonicity of distance-rationalizable voting rulesEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. atal 2011: 821-828 [doi]

Cloning in Elections: Finding the Possible WinnersEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. jair, 42:529-573, 2011. [doi]

2010

Good Rationalizations of Voting RulesEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. AAAI 2010: 774-779 [doi]

On the role of distances in defining voting rulesEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. atal 2010: 375-382 [doi]

Cloning in ElectionsEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. AAAI 2010: 768-773 [doi]

2009

On distance rationalizability of some voting rulesEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. tark 2009: 108-117 [doi]

Swap BriberyEdith Elkind, Piotr Faliszewski, Arkadii M. Slinko. sagt 2009: 299-310 [doi]

2008

Approximability of Dodgson's ruleJohn Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko. scw, 31(2):311-330, 2008. [doi]

2007

Flippable Pairs and Subset Comparisons in Comparative Probability OrderingsRobin Christian, Marston Conder, Arkadii M. Slinko. order, 24(3):193-213, 2007. [doi]

Orders on Multisets and Discrete ConesMarston Conder, Simon Marshall, Arkadii M. Slinko. order, 24(4):277-296, 2007. [doi]

2006

On the Average Minimum Size of a Manipulating CoalitionGeoffrey Pritchard, Arkadii M. Slinko. scw, 27(2):263-277, 2006. [doi]

2005

Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability OrderingsRobin Christian, Arkadii M. Slinko. isipta 2005: 117-124

2002

Degree spectra and computable dimensions in algebraic structuresDenis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko. APAL, 115(1-3):71-113, 2002.

Sign in or sign up to see more results.

runs on WebDSL