We study the election of sequences of committees, where in each of $\tau$ levels (e.g. modeling points in time) a committee consisting of $k$ candidates from a common set of $m$ candidates is selected. For each level, each of $n$ agents (voters) may nominate one candidate whose selection would satisfy her. We are interested in committees which are good with respect to the satisfaction per day and per agent. More precisely, we look for egalitarian or equitable committee sequences. While both guarantee that at least $x$ agents per day are satisfied, egalitarian committee sequences ensure that each agent is satisfied in at least $y$ levels while equitable committee sequences ensure that each agent is satisfied in exactly $y$ levels. We analyze the parameterized complexity of finding such committees for the parameters $n,m,k,\tau,x$, and $y$, as well as combinations thereof.

翻译：我们研究委员会序列的选举问题，其中在 $\tau$ 个层级（例如模拟时间点）中的每个层级，需从包含 $m$ 个候选人的公共集合中选出由 $k$ 名候选人组成的委员会。对于每个层级，$n$ 个代理人（选民）中的每位可提名一名候选人，若该候选人被选中，则代理人获得满足。我们关注在每日满意度与每位代理人满意度方面表现良好的委员会，更具体地，寻找平等或公平的委员会序列。两者均保证每日至少有 $x$ 名代理人获得满足，但平等委员会序列确保每位代理人在至少 $y$ 个层级中获得满足，而公平委员会序列确保每位代理人在恰好 $y$ 个层级中获得满足。我们分析寻找此类委员会的参数化复杂度，涉及参数 $n, m, k, \tau, x, y$ 及其组合。