Procedure
Ballot uses range.
Counting:
N is the number of winners.
For each subset of N candidates, the following processes apply:
 for each vote, the ratings of the N candidates considered are sorted from best in first position, to worst in last position (after having sorted them, it’s possible to maximize the weight of the vote by normalizing the ratings, but I don’t think it makes sense in this context).
 for each position, the sorted ratings are added, obtaining at the end a list of sums Si.
 divide each Si by the position Pi, which starts from 1 (variants of this method can be obtained by multiplying or dividing Si for other values).
 Si are added to obtain a single R value associated with the subset of candidates considered.
The subset of candidates with the highest R, contains the N winners.
Example to calculate R

5 votes with range [0,5]:
A[5] B[4] C[2] D[1] E[0]
A[4] B[5] C[0] D[3] E[2]
A[0] B[3] C[4] D[5] E[0]
A[1] B[0] C[2] D[4] E[5]
A[2] B[2] C[5] D[0] E[3] 
Subset {B,C,D}. Ratings sorted for each vote (without normalization):
4  2  1
5  3  0
5  4  3
4  2  0
5  2  0 
Get sums Si for each position Pi:
[ 23  13  4 ] 
Si divided by Pi:
[ 23/1  13/2  4/3 ] = [ 23  6.5  1.33 ] 
Sum the Si to get R:
R = 30.83
P.S.
If there is already a similar method, tell me in the comments.
This method is currently quite a category of methods with many variations. I have yet to figure out which variant is the best.
Currently, I would say that “the best variant” (the default definition) is:
no normalization of votes, Si divided by position, range [0,3].