26. Limitations of the MedRank algorithm
Invited abstract in session WD-2: Applications, stream Game theory.
Wednesday, 12:00 - 13:30Room: C 103
Authors (first author is the speaker)
| 1. | Attila Tasnádi
|
| Department of Mathematics, Corvinus University of Budapest |
Abstract
Voting rules can be derived as distance minimization problems. Under quite restrictive conditions the MedRank algorithm minimizes the so-called Spearman footrule. We highlight the limitation of this result and also investigate the possibility of appropriate refinements of the MedRank algorithm. In addition, we show that the analogous problem does not arise when minimizing Spearman rank correlation, which results in the Borda count.
Keywords
- Optimization in industry, business and finance
- Analysis and engineering of optimization algorithms
- SS - Optimal Control and Optimization in Economics, Finance
Status: accepted
Back to the list of papers