Arkadii Slinko's home page

Dr Arkadii Slinko PhD, DSc (Sobolev Institute of Mathematics)
Professor (1993)
Department of Mathematics & Center for Mathematics in Social Sciences

Room Number: 303-509
Extension: 85749
Fax: 64-9-3737457
E-mail: a.slinko -AT- auckland.ac.nz

Current Research Areas: 1) Mathematical politics and mathematical economics, 2) Applied algebra and combinatorics with particular interest in mathematics of voting and decision making in general, 3) Computational Social Choice.

$University Homepage$

My Curriculum Vitae in pdf format (maybe slightly outdated). My Google Scholar Citations profile. View also my research on my SSRN Author page.

Graduate and post-graduate students

Kerry Manson, Social Assignment Rules (M.Sc., Auckland University, in progress),
Nina Anchugina, Ranking investment projects (Ph.D., Auckland University, in progress),
Sergey Ozernikov, Web of Trust: axiomatic approach (Ph.D., Auckland University, in progress),
Shaun White, Social choice and social networks (Ph.D., Auckland University, in progress),
Ali Hameed, Simple games and secret sharing schemes (Ph.D., Auckland University, 2013),
Tatiana Gvozdeva, Simple Games: Weightedness and Generalizations (Ph.D., Auckland University, 2012),
Torsten Neher, Case-Based Decision Theory (M.Sc., Auckland University, 2009),
Dominic Searles, Initial Ideals in the Exterior Algebra (M.Sc., Auckland University, 2008),
John McCabe-Dansted, Approximability and computational feasibility of Dodgson's rule (M.Sc., Auckland University, 2006).
Wayland Leung, A Statistical Investigation of Social Choice Functions (M.Sc., Auckland University, 2003).

Inquiries from prospective MSc and PhD students in the following research areas are most welcome:

Topics in the theory of simple games,
Topics in the theory of secret sharing schemes,
Topics in single-winner and multi-winner electoral systems.

Recent invited lectures

Simple games and ideal secret sharing schemes, Workshop on Simple Games. Dauphine University, 27 September 2013.
Can we win the clone war?, ADT-13, Brussels, 13 November, 2013
Algebra for Cryptology (lecture for teachers), Auckland Mathematics Association meeting, 6 April, 2013.
Electoral Equilibria under Scoring Voting Rules, NTU, Singapore, 18 October, 2011.
Manipulation of Elections in Age of Twitter, LORI-III, Guangzhou, 11 October, 2011.
Mathematics of Proportional Representation, (COMPASS) Auckland, 21 May, 2010.
Simple Games Beyond Weighted Majority Games, Auckland, 2010.
New Bounds for Simple Games. Moscow, Higher School of Economics, November, 2009.

Publications

Recent working papers and papers in print:

Dynamic Choice in a Complex World (with Murali Agastya), Journal of Economic Theory, accepted.
A Characterization of Ideal Weighted Secret Sharing Schemes (with Ali Hameed) (17 Aug 2013) arXiv:1308.3763 [cs.CR].
Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality (with Dodge Cahan, John McCabe-Dansted) (2 Jan 2013) arXiv:1301.0152 [cs.GT].
Swap Bribery (with E. Elkind and P. Faliszewski) Manuscript (May 20, 2009). Available at SSRN: http://ssrn.com/abstract=1422183

Recently published chapters, papers in journals and conference proceedings:

Rationalizations of Voting Rules (with E. Elkind). In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice, chapter 8. Cambridge University Press, 2015. Forthcoming.
Gibbard-Satterthwaite Games (with E. Elkind, U. Grandi, F. Rossi) IJCAI, 2015.
Generalizing the single-crossing property on lines and trees to intermediate preferences on median graphs (with A. Clearwater and C. Puppe), IJCAI 2015.
Achieving Fully Proportional Representation: Approximability Results (with P. Skowron and P. Faliszewski). Artificial Intelligence 222 (2015) 67--103.
Noncoherent initial ideals in exterior algebras (with Dominic Searles), Beitrage zur Algebra und Geometrie. Online first, 13 Feb 2015. Available at arXiv:1407.6676 [math.AC], 2014.
Properties of Multiwinner Voting Rules. (with E. Elkind, P. Faliszewski, P. Skowron) AAMAS-14, 53-60.
Is It Ever Safe to Vote Strategically? (with Shaun White) Social Choice and Welfare. 43, Issue 2 (2014), Page 403-427.
Simplicial Complexes Obtained from Qualitative Probability Orders (with Paul Edelman and Tatyana Gvozdeva) SIAM J. Discrete Math., 27(4) (2013), 1820--1843. (18 Aug 2011), arXiv:1108.3700v1 [math.CO].
On the Computation of Fully Proportional Representation (with Nadja Betzler and Johannes Uhlmann), Journal of Artificial Intelligence Research 47 (2013), 475--519. Available at CoRR abs/1402.0580 (2014).
Weightedness and structural characterization of hierarchical simple games. (with A. Hameed and T.Gvozdeva), Mathematical Social Sciences 65 (2013), pp. 181-189.
On the Number of Facets of Polytopes Representing Comparative Probability Orders (with Ilya Chevyrev and Dominic Searles), Order, 30, Issue 3 (2013), pp 749-761.
Clone Structures in Voters' Preferences (with P. Faliszewski and E. Elkind), EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce 2012: 496-513, ACM, New York, NY.
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type (with Edith Elkind, Piotr Faliszewski) Social Choice and Welfare. 2012, Volume 39, Issue 4, pp 891-905.
Three Hierarchies of Simple Games Parameterized by ``Resource'' Parameters (with T. Gvozdeva and L. A. Hemaspaandra). International Journal of Game Theory, 2011, DOI 10.1007/s00182-011-0308-4.
Cloning in Elections (with E. Elkind and P. Faliszewski). JAIR, 42 (2011), pp. 529-573.
Homogeneity and Monotonicity of Distance-Rationalizable Voting Rules (with E. Elkind, P. Faliszewski), Proceedings of 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Tumer, Yolum, Sonenberg and Stone (eds.), May, 2 - 6, 2011, Taipei, Taiwan, pp. 821-828.
Weighted and Roughly Weighted Simple Games (with Tatiana Gvozdeva). Mathematical Social Sciences 61 (2011) 20-30. Available at SSRN: http://ssrn.com/abstract=1529223
Proportional Representation and Strategic Voters (with Shaun White). Journal of Theoretical Politics. 2010, 22(3): 301 - 332.
Good Rationalizations of Voting Rules (with E. Elkind and P. Faliszewski), Twenty-Fourth Conference on Artificial Intelligence (AAAI-10), Maria Fox and David Poole(eds.), Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA, 11-15 July, 2010, p.774-779.
On the role of distances in defining voting rules. (with E. Elkind and P. Faliszewski) Wiebe van der Hoek, Gal A. Kaminka, Yves Lesp\'{e}rance, Michael Luck, and Sandip Sen, eds. AAMAS 2010: Proceedings of the Ninth International Conference on Autonomous Agents and Multi-Agent Systems. IFAAMAS: Internatioal Foundation for Autonomous Agents and Multiagent Systems, Toronto, Canada, May 10--14, pp. 375--382. 2010.
Orders on Subsets Rationalised by Abstract Convex Geometries (with Matthew Ryan and Walter Bossert). Order, 2009, 26(3): 237--244.
Axioms for a Class of Algorithms of Sequential Decision Making (with M. Agastya) In: F. Rossi and A. Tsoukis (Eds.): ``Algorithmic Decision Theory.'' Proceedings of the ADT 2009, LNAI 5783, pp. 353--364. Springer Heidelberg (2009).
On distance rationalizability of some voting rules (with P. Faliszewski and E. Elkind) In: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XII). California, 2009.
Additive representation of finite measurement structures (survey). Additive Representability of Finite Measurement Structures. In: "The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn". Eds. SJ Brams, WV Gehrlein and FS Roberts. Springer, 2009.
Swap bribery (with P. Faliszewski and E. Elkind) In: M. Mavronicolas and V.G. Papadopoulou (Eds.): ``Algorithmic Game Theory.'' Proceedings of the Second International Symposium, SAGT 2009, LNAI 5814, pp. 299--310. Springer Heidelberg, 2009.
Approximability of Dodgson's rule (with John McCabe-Dansted and Geoffrey Pritchard), Social Choice and Welfare, 2008, Volume 31(2): 311--330
Self-Selective Social Choice Functions (with Semih Koray), Social Choice and Welfare, 2008, 31(1): 129--149. Springer online (2007) DOI: 10.1007/s00355-007-0276-6
Ranking Committees, Income Streams or Multisets (with M. Sertel), Economic Theory, 2007, 30(2): 265--287.
On Complexity of Lobbying in Multiple Referenda (with Robin Christian, Mike Fellows and Fran Rosamond), Review of Economic Design, 2007, 11(3): 217--224.
Flippable Pairs and Subset Comparisons in Comparative Probability Orderings (with Robin Christian and Marston Conder) Order, 2007, 24(3): 193-213.
Orders on Multisets and Discrete Cones (with Marston Conder and Simon Marshall) Order, 2007, 24(4): 277--296.
Comparative Probability Orders and the Flip Relation (with Marston Conder and Dominic Searles) The 5th International Simposium on Imprecise Probability: Theories and Applications (ISIPTA 07), Prague, Czech Republic, 2007, 67-76.
Relative Uncertainty Aversion and Additively Representable Set Rankings (with W. Bossert), International Journal of Economic Theory, 2006, 2: 105--122.
On the Average Minimum Size of Manipulating Coalition (with G. Pritchard), Social Choice and Welfare, 2006, 27(2), 263--277.
Exploratory Analysis of Similarities between Common Social Choice Rules (with J. McCabe-Dansted), Decision and Negotiation, 2006, 15(1), 77--107.
How the Size of a Coalition Affects its Chances to Influence an Election , Social Choice and Welfare, 2006, 26(1): 143--153.
On Complexity of Lobbying in Multiple Referenda (with Robin Christian, Mike Fellows and Frances Rosamond), Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC--2006). Eds. Ulle Endriss and Jerome Lang. Universiteit van Amsterdam, 2006, 87--96.
Approximability of Dodgson's Rule (with John McCabe Dansted and Geoff Pritchard), Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC--2006). Eds. Ulle Endriss and Jerome Lang. Universiteit van Amsterdam, 2006, 331--344.
Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings (with R. Christian), Proceedings of The 4th International Simposium on Imprecise Probabilities and Their Applications (ISIPTA 05), Pittsburg, Pensylvania, 2005, 117--124.
A Counterexample to Fishburn's Conjecture on Finite Linear Qualitative Probability (with Marston Conder), Journal of Mathematical Psychology, 2004, 48(6), 425--431.
1,2,4,8... What comes next? Extracta Mathematicae, 19 (2004), 155-161.
How Large a Coalitional Should Be to Manipulate an Election?, Mathematical Social Sciences, 2004, 47(3): 289--293.

Books

Rings that are nearly associative (Russian). Izd-vo Nauka, Moskva, 1978, 431 pp. (with Zhevlakov, K.A.; Shestakov, I.P.; Shirshov A.I.). English translation: Rings that are nearly associative. Academic Press, New York - London, 1982, xi+371 pp.
USSR Mathematical Olympiads 1989-1992. Australian Mathematics Trust, Canberra, 1997, 136 pp.
Mathematics Olympiads for Secondary School Students (9th form) (Russian), Prosveschenie, Moscow, 1997, 208 pp (with N.Agahanov, V.Kuptzov, Ju.Nesterenko, S.Reznichenko)
Mathematics Olympiads for School Students of 10th form (Russian), Prosveschenie, Moscow, 1998, 256 pp (with V. Kuptzov, Ju. Nesterenko, S. Reznichenko)
Mathematics Olympiads for School Students of 11th form (Russian), Prosveschenie, Moscow, 1999, 254 pp (with V. Kuptzov, Ju. Nesterenko, S. Reznichenko).

Address

Dr. A.M.Slinko
Department of Mathematics
University of Auckland
Private Bag 92019, Auckland
NEW ZEALAND

Last changed 19 April 2015.