{
  "id": "1711.06641",
  "version": "v1",
  "published": "2017-11-17T17:36:35.000Z",
  "updated": "2017-11-17T17:36:35.000Z",
  "title": "The Complexity of Multiwinner Voting Rules with Variable Number of Winners",
  "authors": [
    "Piotr Faliszewski",
    "Arkadii Slinko",
    "Nimrod Talmon"
  ],
  "comment": "15 pages, 2 figures, 1 table",
  "categories": [
    "cs.GT"
  ],
  "abstract": "We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning candidates are quite well studied, the study of elections with variable number of winners has only recently been initiated by Kilgour. This paper aims at achieving a better understanding of these rules, their computational complexity, and on scenarios for which they might be applicable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-11-17T17:36:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "multiwinner voting rules",
      "variable number",
      "computational complexity",
      "paper aims",
      "output committees"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}