This paper deals with a recently proposed method for a ranked voting system. It is based on a data envelopment analysis model. It is shown that the number of problems to be solved and the number of constraints in the model can be decreased. In addition, the winner can be selected with a fewer efforts and in some cases without solving any problems. The obtained results also illustrate the importance of selecting a proper norm in the model.
|Number of pages||10|
|Journal||Applied Mathematics and Computation|
|Publication status||Published - 5 Apr 2005|
- Data envelopment analysis