首页> 外文会议>AAAI Conference on Artificial Intelligence >On Computing Optimal Strategies in Open List Proportional Representation: the Two Parties Case
【24h】

On Computing Optimal Strategies in Open List Proportional Representation: the Two Parties Case

机译:在公开名单中计算最佳策略比例代表:双方案例

获取原文
获取外文期刊封面目录资料

摘要

Open list proportional representation is an election mechanism used in many elections, including the 2012 Hong Kong Legislative Council Geographical Constituencies election. In this paper, we assume that there are just two parties in the election, and that the number of votes that a list would get is the sum of the numbers of votes that the candidates in the list would get if each of them would go alone in the election. Under these assumptions, we formulate the election as a mostly zero-sum game, and show that while the game always has a pure Nash equilibrium, it is NP-hard to compute it.
机译:公开名单比例陈述是许多选举中使用的选举机制,包括2012年香港立法会地理选区选举。在本文中,我们认为选举中只有两方,列表将获得的投票数量是列表中候选人的票数的总和,如果他们中的每一个都可以独一无止在选举中。在这些假设下,我们将选举制订为主要零和游戏,并表明游戏总是具有纯净的纳什均衡,它是努力计算它。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号