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...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 336; no. 3; pp. 2091 - 2110
Main Authors: Boros, Endre, Čepek, Ondřej, Gurvich, Vladimir, Makino, Kazuhisa
Format: Journal Article
Language:English
Published: New York Springer US 01.05.2024
Springer
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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 ≥ α 1 - 2 ≥ 0 then the unique voting correspondence has distinct rows. We also characterize voting forms with distinct rows.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-023-05430-2