Recognizing distributed approval voting forms and correspondences

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish (US)
JournalAnnals of Operations Research
StateAccepted/In press - 2023

All Science Journal Classification (ASJC) codes

  • General Decision Sciences
  • Management Science and Operations Research


  • Distributed approval voting
  • Polynomial time recognition algorithm
  • Voting correspondence
  • Voting form
  • Voting scheme


Dive into the research topics of 'Recognizing distributed approval voting forms and correspondences'. Together they form a unique fingerprint.

Cite this