This section describes the rank aggregation algorithms implemented in FLAGR. The following articles also contain brief descriptions of the respective exposed C functions which make these algorithms accessible from other programs (in case the FLAGR shared library is used).
This section contains the following articles:
- 2.1. Linear Combination methods
- 2.2. Condorcet Winners
- 2.3. Copeland Winners
- 2.4. Outranking Approach
- 2.5. Markov Chains methods
- 2.6. Kemeny Optimal Aggregation
- 2.7. Robust Rank Aggregation
- 2.8. Iterative Distance-Based weighted aggregation
- 2.9. Preference Relations weighted method
- 2.10. Agglomerative weighted aggregation