投票选举可投票社团的委员会
Voting for Committees in Agreeable Societies
摘要：
我们来看看下面的投票情况。由n名候选人组成的$k$委员会。选择委员会的选民将提交一份他们希望加入委员会的$j$候选人名单。我们假设$j \leq k < n$。对于一个选定的委员会，如果一个给定的投票人提交的$j$候选人名单是该委员会的一个子集，则该委员会认为该投票人满意。我们来看看最受欢迎的委员会有多受欢迎。特别是，我们表明，总是有一个委员会，满足一定比例的选民，并检查选民数据的哪些特征将增加这一部分。
英文摘要：
We examine the following voting situation. A committee of $k$ people is to be formed from a pool of n candidates. The voters selecting the committee will submit a list of $j$ candidates that they would prefer to be on the committee. We assume that $j \leq k < n$. For a chosen committee, a given voter is said to be satisfied by that committee if her submitted list of $j$ candidates is a subset of that committee. We examine how popular is the most popular committee. In particular, we show there is always a committee that satisfies a certain fraction of the voters and examine what characteristics of the voter data will increase that fraction.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
