Abstract
AbstractThe time required for solving the ranking aggregation problem using the Kemeny method increases factorially with the number of alternatives to be ranked, which prevents its use when this number is large. Exact algorithms use domain information to discard rankings as possible solution, thus saving runtime. The amount of rankings that can be discarded varies for each profile and cannot be known beforehand. For profiles of rankings with large number of alternatives, the amount of rankings discarded highly affects the feasibility of the computation of Kemeny ranking. How to identify the profiles that are more time-consuming when finding the Kemeny ranking is not trivial. In this work we propose the use of machine learning models to predict how difficult is to obtain the Kemeny ranking in terms of runtime. The results obtained are promising, with values of the area under the curve metric over 80%. Furthermore, it is possible to extract from the proposed models the characteristics of the profile of rankings that impact on the runtime.
Funder
Agencia Estatal de Investigación
Universidad de Oviedo
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Ali A, Meila M (2012) Experiments with Kemeny ranking: what works when? Math Soc Sci 64(1):28–40
2. Arrow K, Raynaud H (1986) Social choice and multicriterion decision-making, vol 1, 1st edn. The MIT Press, Cambridge
3. Azzini I, Munda G (2020) A new approach for identifying the Kemeny median ranking. Eur J Oper Res 281:388–401
4. Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6(2):157–165
5. Betzler N, Fellows MR, Guo J, Niedermeier R, Rosamond FA (2008) Fixed-parameter algorithms for Kemeny scores, volume 5034 of lecture notes in computer science. Springer, Berlin, pp 60–71
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献