{"title":"衡量流动民主中的先验投票权","authors":"Rachael Colley, Théo Delemazure, Hugo Gilbert","doi":"10.24963/ijcai.2023/290","DOIUrl":null,"url":null,"abstract":"We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our power indices are natural extensions of the standard Penrose-Banzhaf index in simple voting games.\n\nWe show that computing the criticality of a voter is #P-hard even in weighted games with weights polynomially-bounded in the size of the instance.\n\nHowever, for specific settings, such as when the underlying network is a bipartite or complete graph, recursive formulas can compute these indices for weighted voting games in pseudo-polynomial time.\n\nWe highlight their theoretical properties and provide numerical results to illustrate how restricting the possible delegations can alter voters' voting power.","PeriodicalId":394530,"journal":{"name":"International Joint Conference on Artificial Intelligence","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Measuring a Priori Voting Power in Liquid Democracy\",\"authors\":\"Rachael Colley, Théo Delemazure, Hugo Gilbert\",\"doi\":\"10.24963/ijcai.2023/290\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our power indices are natural extensions of the standard Penrose-Banzhaf index in simple voting games.\\n\\nWe show that computing the criticality of a voter is #P-hard even in weighted games with weights polynomially-bounded in the size of the instance.\\n\\nHowever, for specific settings, such as when the underlying network is a bipartite or complete graph, recursive formulas can compute these indices for weighted voting games in pseudo-polynomial time.\\n\\nWe highlight their theoretical properties and provide numerical results to illustrate how restricting the possible delegations can alter voters' voting power.\",\"PeriodicalId\":394530,\"journal\":{\"name\":\"International Joint Conference on Artificial Intelligence\",\"volume\":\"142 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Joint Conference on Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24963/ijcai.2023/290\",\"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 Joint Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24963/ijcai.2023/290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们引入了新的权力指数来衡量选民在流动民主选举中的先验投票权,其中潜在的网络限制了代表团。我们认为我们的权力指数是简单投票游戏中标准Penrose-Banzhaf指数的自然延伸。我们证明,即使在权重以实例的大小为多项式界的加权博弈中,计算选民的临界性也是# p -困难的。然而,对于特定的设置,例如当底层网络是二部图或完全图时,递归公式可以在伪多项式时间内计算加权投票游戏的这些指标。我们强调了它们的理论性质,并提供了数值结果来说明限制可能的代表团如何改变选民的投票权。
Measuring a Priori Voting Power in Liquid Democracy
We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our power indices are natural extensions of the standard Penrose-Banzhaf index in simple voting games.
We show that computing the criticality of a voter is #P-hard even in weighted games with weights polynomially-bounded in the size of the instance.
However, for specific settings, such as when the underlying network is a bipartite or complete graph, recursive formulas can compute these indices for weighted voting games in pseudo-polynomial time.
We highlight their theoretical properties and provide numerical results to illustrate how restricting the possible delegations can alter voters' voting power.