arrow
返回

Recognizing distributed approval voting forms and correspondences

delete2023-06-15
delete1
PRE
AI
E
Endre Boros
O
Ondřej Čepek
V
Vladimir Gurvich *
K
Kazuhisa Makino
DOI:10.1007/s10479-023-05430-2delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We consider distributed approval voting schemes. Each voter i ? I has a(i) cards that (s)he distributes among the candidates a ? 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 a(2) = a(1) - 2 = 0 then the unique voting correspondence has distinct rows. We also characterize voting forms with distinct rows.
Keyword:
Distributed approval voting
Voting scheme
Voting form
Voting correspondence
Polynomial time recognition algorithm

期刊

Annals of Operations Research 封面图
Annals of Operations Research
IF:
4.5
论文数:
8.0K
被引数:
2.1W

机构

R
rutgers university new brunswick
学者数:
2.3W
论文数: 1.9W
被引数: 32
R
rutgers university system
学者数:
4.1W
论文数: 3.7W
被引数: 53
C
Charles University Prague
学者数:
2.9W
论文数: 2.2W
被引数: 158
学者 查看更多机构
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
err分享
err收藏
The learnability of voting rules
err2009-08-01
err20
errOAAI
errProcaccia, Ariel D.; Zohar, Aviv; Peleg, Yoni; Rosenschein, Jeffrey S.
err分享
err收藏
学者 查看更多内容