Recognizing distributed approval voting forms and correspondences

arXiv2010.15730MaRDI QIDQ6352575FDOQ6352575

Ondřej Čepek, Kazuhisa Makino, Endre Boros, Vladimir Gurvich

Publication date: 29 October 2020

Abstract: Each voter

i i n I

has

a l p h a_{i}

cards that (s)he distributes among the candidates

a i n 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 l p h a_{2} g e q a l p h a_{1} - 2 g e q 0

then the unique voting correspondence has distinct rows. We also characterize voting forms with distinct rows.

This page was built for publication: Recognizing distributed approval voting forms and correspondences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352575)