Department of Mathematics
Title : Clone Structures
| Speaker: Arkadii Slinko Affiliation: University of Auckland Time: 14:00 Tuesday, 4 June, 2013 Location: 303-412 |
Abstract
| Suppose that we have a family of linear orders on a finite set C. A subset of C which is ranked consecutively (though possibly in different order) in all linear orders is called a clone set. All clone sets for a given family of linear orders form the clone structure. In this paper we formalise and study properties of clone structures. In particular, we give an axiomatic characterisation of clone structures, define the composition of those, classify irreducible ones, and show that it is sufficient to have only three linear orders to realise any clone structure. In applications, a set of linear orders is normally interpreted as opinions of voters about candidates in C. Cloning candidates (products) is one of the most sophisticated tools of manipulation of elections (consumer surveys). Unfortunately most common voting rules are vulnerable to this method of manipulation. So clones do matter. This is a joint work with Piotr Faliszewski (Krakow) and Edith Elkind (Oxford). |
-
Programmes and Centres
- New Zealand Institute of Mathematics and its Applications (NZIMA)
- Community for Understanding and Learning in the Mathematical Sciences (CULMS)
- Centre for Mathematical Social Science (CMSS)
- Department of Computer Science
- Department of Engineering Science
- Department of Physics
- Department of Statistics
- Auckland Bioengineering Institute
