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.

翻译：假定候选人需要选取一万元。 候选人需要随着时间的推移出现。 每次出现时,都必须立即选出或否决,这是一组个人通过投票作出的决定。假设选民使用核准选票,即每个候选人只具体说明他们是否认为可以接受。这种设置可被视为选择一万元秘书的投票变体,我们的贡献是双重的。 (1) 我们评估在网上计算的委员会在多大程度上能够按比例代表选民。 (2) 如果事先有可能获得对候选人的批准,我们展示如何以最高预期分来计算委员会。