划分否决和极值选举控制的复杂性

Cynthia Maushagen, J. Rothe
{"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}
引用次数: 15

摘要

分区控制指的是选举主席试图通过将候选人或选民分成两组来影响选举结果的情况,从而产生两次第一轮分选,决定谁将参加最后一轮。特别是,“不公正划分选区”(恶意调整选区大小)可以通过选民控制攻击来模拟。虽然对许多投票系统的划分控制(以及其他控制行为)的复杂性已经进行了深入的研究,但关于重要系统否决权和最大投票的结果却很少。我们解决了在各种各样的模型中否决的分区控制的复杂性,以及关于候选分区的破坏性控制的最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信