Arkadii M. Slinko

41 papers A* 6A 4B 2Journal 27Unranked 2

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Framing in Secret Sharing. IEEE Trans. Inf. Forensics Secur. Yvo Desmedt, Songbao Mo, Arkadii M. Slinko
2016	J	`jnl`	Axiomatic Characterization of Committee Scoring Rules. CoRR Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2016	J	`jnl`	Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon
2016	A*	`conf`	Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon
2016	A*	`conf`	Voting-Based Group Formation. IJCAI Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon
2015	J	`jnl`	Achieving fully proportional representation: Approximability results. Artif. Intell. Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2015	J	`jnl`	Condorcet Domains, Median Graphs and the Single Crossing Property. CoRR Clemens Puppe, Arkadii M. Slinko
2015	J	`jnl`	Properties of Multiwinner Voting Rules. CoRR Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko
2013	J	`jnl`	A Characterization of Ideal Weighted Secret Sharing Schemes. CoRR Ali Hameed, Arkadii M. Slinko
2013	J	`jnl`	Achieving Fully Proportional Representation is Easy in Practice CoRR Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013	J	`jnl`	Achieving Fully Proportional Representation: Approximability Results. CoRR Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013	A	`conf`	Achieving fully proportional representation is easy in practice. AAMAS Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013	A*	`conf`	Fully Proportional Representation as Resource Allocation: Approximability Results. IJCAI Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2013	J	`jnl`	Is it ever safe to vote strategically? CoRR Arkadii M. Slinko, Shaun White
2013	J	`jnl`	Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality CoRR Dodge Cahan, John Christopher McCabe-Dansted, Arkadii M. Slinko
2013	A	`conf`	On swap-distance geometry of voting rules. AAMAS Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2013	J	`jnl`	Simplicial Complexes Obtained from Qualitative Probability Orders. SIAM J. Discret. Math. Paul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko
2013	J	`jnl`	Three hierarchies of simple games parameterized by "resource" parameters. Int. J. Game Theory Tatiana Gvozdeva, Lane A. Hemaspaandra, Arkadii M. Slinko
2013	J	`jnl`	Weightedness and structural characterization of hierarchical simple games. Math. Soc. Sci. Tatiana Gvozdeva, Ali Hameed, Arkadii M. Slinko
2012	A*	`conf`	Clone structures in voters' preferences. EC Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2012	J	`jnl`	Proportional Representation as Resource Allocation: Approximability Results CoRR Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko
2012	J	`jnl`	Rationalizations of Condorcet-consistent rules via distances of hamming type. Soc. Choice Welf. Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2012	J	`jnl`	Roughly Weighted Hierarchical Simple Games CoRR Ali Hameed, Arkadii M. Slinko
2011	J	`jnl`	Clone Structures in Voters' Preferences CoRR Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011	J	`jnl`	Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011	A	`conf`	Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2011	J	`jnl`	Weighted and roughly weighted simple games. Math. Soc. Sci. Tatiana Gvozdeva, Arkadii M. Slinko
2010	A*	`conf`	Cloning in Elections. AAAI Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010	A*	`conf`	Good Rationalizations of Voting Rules. AAAI Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010	A	`conf`	On the role of distances in defining voting rules. AAMAS Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2010	J	`jnl`	Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type CoRR Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009	—	`conf`	Axioms for a Class of Algorithms of Sequential Decision Making. ADT Murali Agastya, Arkadii M. Slinko
2009	B	`conf`	On distance rationalizability of some voting rules. TARK Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009	J	`jnl`	Swap Bribery CoRR Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2009	B	`conf`	Swap Bribery. SAGT Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
2008	J	`jnl`	Approximability of Dodgson's rule. Soc. Choice Welf. John Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko
2007	J	`jnl`	Flippable Pairs and Subset Comparisons in Comparative Probability Orderings. Order Robin Christian, Marston D. E. Conder, Arkadii M. Slinko
2007	J	`jnl`	Orders on Multisets and Discrete Cones. Order Marston D. E. Conder, Simon Marshall, Arkadii M. Slinko
2006	J	`jnl`	On the Average Minimum Size of a Manipulating Coalition. Soc. Choice Welf. Geoffrey Pritchard, Arkadii M. Slinko
2005	—	`conf`	Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings. ISIPTA Robin Christian, Arkadii M. Slinko
2002	J	`jnl`	Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Log. Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko