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