Recognizing distributed approval voting forms and correspondences

We consider distributed approval voting schemes. Each voter i ∈ I has α 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 fo...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 336; číslo 3; s. 2091 - 2110
Hlavní autoři:	Boros, Endre, Čepek, Ondřej, Gurvich, Vladimir, Makino, Kazuhisa
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.05.2024 Springer Springer Nature B.V
Témata:	Algorithms Awards & honors Business and Management Candidates Cards Combinatorics Elections Methods Operations research Operations Research/Decision Theory Original Research Polynomials Testing Theory of Computation Voters Voting United States Czech Republic Japan Voting form 91B12 68R01 Voting correspondence 91A05 05B20 Distributed approval voting Polynomial time recognition algorithm 91B14 Voting scheme
ISSN:	0254-5330, 1572-9338
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!