论文标题

识别分布式批准投票表和信件

Recognizing distributed approval voting forms and correspondences

论文作者

Boros, Endre, Cepek, Ondrej, Gurvich, Vladimir, Makino, Kazuhisa

论文摘要

I $中的每个选民$ i \都有$α_i$卡,他在$ a \ $ a \ $ a \ $ a中分布,以衡量批准。收到最大卡数的一名(或几个)候选人是(当选)。在候选人人数或选民数量等于$ 2 $的情况下,我们提供了多项式算法,以识别此类投票方案产生的投票表格和投票方案。我们证明,对于两个选民,如果$α_2\geqα_1-2\ geq 0 $,那么唯一的投票信件具有不同的行。我们还表征了不同行的投票表格。

Each voter $i \in I$ has $α_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial algorithms to recognize voting forms and voting correspondences generated by such voting schemes in cases when either the number of candidates or the number of voters is equal to $2$. We prove that for two voters, if $α_2 \geq α_1-2\geq 0$ then the unique voting correspondence has distinct rows. We also characterize voting forms with distinct rows.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源