Platforms for online civic participation rely heavily on methods for condensing thousands of comments into a relevant handful, based on whether participants agree or disagree with them. These methods should guarantee fair representation of the participants, as their outcomes may affect the health of the conversation and inform impactful downstream decisions. To that end, we draw on the literature on approval-based committee elections. Our setting is novel in that the approval votes are incomplete since participants will typically not vote on all comments. We prove that this complication renders non-adaptive algorithms impractical in terms of the amount of information they must gather. Therefore, we develop an adaptive algorithm that uses information more efficiently by presenting incoming participants with statements that appear promising based on votes by previous participants. We prove that this method satisfies commonly used notions of fair representation, even when participants only vote on a small fraction of comments. Finally, an empirical evaluation using real data shows that the proposed algorithm provides representative outcomes in practice.
翻译:在线公民参与平台主要依赖于将成千上万的评论凝结成几个相关的评论的方法,这些评论基于参与者是否同意或不同意它们。这些方法应保证公平代表参与者,因为它们的结果可能影响对话的健康并且通知有影响力的下游决策。为此,我们借鉴认可票委员会选举的文献。我们的设置是新颖的,因为认可选票是不完整的,因为参与者通常不会对所有评论进行投票。我们证明这种复杂情况使得非自适应算法在信息收集方面不切实际。因此,我们开发了一种自适应算法,该算法通过向先前参与者的投票结果中看起来有前途的声明来更有效地使用信息。我们证明了即使参与者仅对少部分评论进行投票,该方法也满足常用的公平代表概念。最后,使用真实数据的实证评估表明,所提议的算法在实践中提供了代表性结果。