Recognizing distributed approval voting forms and correspondences

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493957" target="_blank" >RIV/00216208:11320/24:10493957 - isvavai.cz</a>
Výsledek na webu
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=viIssBU8Kg" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=viIssBU8Kg</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10479-023-05430-2" target="_blank" >10.1007/s10479-023-05430-2</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Recognizing distributed approval voting forms and correspondences
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Recognizing distributed approval voting forms and correspondences
Popis výsledku anglicky
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.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GA19-19463S" target="_blank" >GA19-19463S: Reprezentace booleovských funkcí úplné vzhledem k jednotkové propagaci</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2024
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)