{"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}
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?