{"title":"划分否决和极值选举控制的复杂性","authors":"Cynthia Maushagen, J. Rothe","doi":"10.3233/978-1-61499-672-9-277","DOIUrl":null,"url":null,"abstract":"Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. In particular, “gerrymandering” (maliciously resizing election districts) can be modeled by partition-of-voters control attacks. While the complexity of control by partition (and other control actions) has been studied thoroughly for many voting systems, such results about the important systems veto and maximin voting are sparse. We settle the complexity of control by partition for veto in a broad variety of models and for maximin with respect to destructive control by partition of candidates.","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Complexity of Control by Partitioning Veto and Maximin Elections\",\"authors\":\"Cynthia Maushagen, J. Rothe\",\"doi\":\"10.3233/978-1-61499-672-9-277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. In particular, “gerrymandering” (maliciously resizing election districts) can be modeled by partition-of-voters control attacks. While the complexity of control by partition (and other control actions) has been studied thoroughly for many voting systems, such results about the important systems veto and maximin voting are sparse. We settle the complexity of control by partition for veto in a broad variety of models and for maximin with respect to destructive control by partition of candidates.\",\"PeriodicalId\":354113,\"journal\":{\"name\":\"International Symposium on Artificial Intelligence and Mathematics\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Artificial Intelligence and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-61499-672-9-277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Artificial Intelligence and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-61499-672-9-277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complexity of Control by Partitioning Veto and Maximin Elections
Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. In particular, “gerrymandering” (maliciously resizing election districts) can be modeled by partition-of-voters control attacks. While the complexity of control by partition (and other control actions) has been studied thoroughly for many voting systems, such results about the important systems veto and maximin voting are sparse. We settle the complexity of control by partition for veto in a broad variety of models and for maximin with respect to destructive control by partition of candidates.