论文标题
在线批准委员会选举
Online Approval Committee Elections
论文作者
论文摘要
假设需要选择$ K $候选人。候选人会随着时间的流逝而出现。每次出现时，都必须立即选择或拒绝它 - 一组个人通过投票做出的决定。假设选民使用批准选票，即，对于每个候选人，他们只指定他们是否认为可以接受。该设置可以看作是选择$ K $秘书的投票变体。我们的贡献是双重的。 （1）我们评估在线计算的委员会在多大程度上可以按比例地代表选民。 （2）如果获得了候选人批准的先验概率，我们将展示如何以最高预期得分计算委员会。
Assume $k$ candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected -- a decision that is made by a group of individuals through voting. Assume the voters use approval ballots, i.e., for each candidate they only specify whether they consider it acceptable or not. This setting can be seen as a voting variant of choosing $k$ secretaries. Our contribution is twofold. (1) We assess to what extent the committees that are computed online can proportionally represent the voters. (2) If a prior probability over candidate approvals is available, we show how to compute committees with maximal expected score.
