保护选举

Garima Shakya
{"title":"保护选举","authors":"Garima Shakya","doi":"10.1145/3371158.3371213","DOIUrl":null,"url":null,"abstract":"Election control considers the issues where an external agent wants to change the structure of the election to change the outcome. Researchers model the problem as a Stackelberg game with two players, Defender and Attacker. The questions we focus on are, is it possible for the attacker to influence the outcome of the election? How hard is it to change the winner by deleting or manipulating a finite number of voter groups? How hard is it to defend the election with a finite budget? How the problem of attack and defend varies with the limited information the defender and attacker have?","PeriodicalId":360747,"journal":{"name":"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Protecting Elections\",\"authors\":\"Garima Shakya\",\"doi\":\"10.1145/3371158.3371213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Election control considers the issues where an external agent wants to change the structure of the election to change the outcome. Researchers model the problem as a Stackelberg game with two players, Defender and Attacker. The questions we focus on are, is it possible for the attacker to influence the outcome of the election? How hard is it to change the winner by deleting or manipulating a finite number of voter groups? How hard is it to defend the election with a finite budget? How the problem of attack and defend varies with the limited information the defender and attacker have?\",\"PeriodicalId\":360747,\"journal\":{\"name\":\"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3371158.3371213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th ACM IKDD CoDS and 25th COMAD","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3371158.3371213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

选举控制考虑外部代理人想要改变选举结构以改变结果的问题。研究人员将这个问题建模为一个斯塔克尔伯格游戏,有两个玩家,防守者和攻击者。我们关注的问题是,攻击者是否有可能影响选举结果?通过删除或操纵有限数量的选民群体来改变获胜者有多难?在有限的预算下捍卫选举有多难?进攻和防守的问题如何随防守方和攻击方所拥有的有限信息而变化?
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Protecting Elections
Election control considers the issues where an external agent wants to change the structure of the election to change the outcome. Researchers model the problem as a Stackelberg game with two players, Defender and Attacker. The questions we focus on are, is it possible for the attacker to influence the outcome of the election? How hard is it to change the winner by deleting or manipulating a finite number of voter groups? How hard is it to defend the election with a finite budget? How the problem of attack and defend varies with the limited information the defender and attacker have?
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信