Ebert's method: Difference between revisions

A "load distribution" is a two-dimensional array <math>X_{v,c}</math> with <math>v=1..\ldots V, \,c=1..\ldots C</math> such that:

# <math> 0 <=\leq X_{v,c} <=\leq 1</math>

# <math>X_{v,c}=0</math> unless v approves c

# DoubleSum <math>\sum_{v}\sum_{c}\,X_{v,c} = W</math>

# for each candidate c, Sum_v<math>\sum_{v} X_{v,c} = 1</math> if c is a winner, otherwise <math>=0</math>.

The winner set is the set which minimizes the SUM_v <math>\sum_{v}( SUM_c\sum_{c} X_{v,c} )^2</math>.