发帖
雷达卡
摘要翻译：
在投票过程中，一些新的候选人可能会出现。在这种情况下，我们可能希望确定哪些初始候选人是可能的获胜者，假设将添加固定数量的新候选人$k$。我们给出了这个问题的计算研究，重点是评分规则，并给出了与通过添加候选控制或克隆控制等相关问题的形式比较。
---
英文标题：
《New Candidates Welcome! Possible Winners with respect to the Addition of
New Candidates》
---
作者：
Yann Chevaleyre, J\'er\^ome Lang, Nicolas Maudet, J\'er\^ome Monnot,
Lirong Xia
---
最新提交年份：
2011
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number $k$ of new candidates will be added. We give a computational study of this problem, focusing on scoring rules, and we provide a formal comparison with related problems such as control via adding candidates or cloning.
---
PDF链接：
https://arxiv.org/pdf/1111.3690
京公网安备 11010802022788号
