A. Agarwal, S. Agarwal, S. Assadi, and S. Khanna, Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons, The 30th Conference on Learning Theory (COLT), pp.39-75, 2017.

A. Agarwal, P. Patil, and S. Agarwal, Accelerated spectral ranking, Proceedings of the 35th International Conference on Machine Learning (ICML), pp.70-79, 2018.

S. Agarwal, On ranking and choice models, Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp.4050-4053, 2016.

A. Aiguzhinov, C. Soares, and A. P. Serra, A similarity-based adaptation of naive bayes for label ranking: Application to the metalearning problem of algorithm recommendation, International Conference on Discovery Science, pp.16-26, 2010.

N. Ailon, Aggregation of partial rankings, p-ratings and top-m lists, vol.57, pp.284-300, 2010.

N. Ailon, An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity, Journal of Machine Learning Research, vol.13, pp.137-164, 2012.

N. Ailon, Improved bounds for online learning over the permutahedron and other ranking polytopes, Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics (AISTATS), pp.29-37, 2014.

N. Ailon, M. Charikar, and A. Newman, Aggregating inconsistent information: Ranking and clustering, Journal of the ACM (JACM), vol.55, issue.5, 2008.

N. Ailon, K. Hatano, and E. Takimoto, Bandit online optimization over the permutahedron, International Conference on Algorithmic Learning Theory (ALT), pp.215-229, 2014.

L. Akritidis, D. Katsaros, and P. Bozanis, Effective rank aggregation for metasearching, Journal of Systems and Software, vol.84, issue.1, pp.130-143, 2011.

J. Aledo, J. A. Gámez, and D. Molina, Tackling the supervised label ranking problem by bagging weak learners, Information Fusion, vol.35, pp.38-50, 2017.

J. A. Aledo, J. A. Gámez, and A. Rosete, Utopia in the solution of the bucket order problem. Decision Support Systems, vol.97, pp.69-80, 2017.

J. A. Aledo, J. A. Gámez, and A. Rosete, Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem, European Journal of Operational Research, 2018.

A. Ali and M. Meila, Experiments with kemeny ranking: What works when?, Mathematical Social Sciences, vol.64, issue.1, pp.28-40, 2012.

N. Alon, Ranking tournaments, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.137-142, 2006.

M. Alvo and P. L. Yu, Statistical Methods for Ranking Data, 2014.

D. F. Alwin and J. A. Krosnick, The measurement of values in surveys: A comparison of ratings and rankings, Public Opinion Quarterly, vol.49, issue.4, pp.535-552, 1985.

K. J. Arrow, A difficulty in the concept of social welfare, The Journal of Political Economy, pp.328-346, 1950.

K. J. Arrow, Social choice and individual values, 1951.

J. A. Aslam and M. Montague, Models for metasearch, Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, pp.276-284, 2001.

J. Y. Audibert and A. Tsybakov, Fast learning rates for plug-in classifiers, Annals of statistics, vol.35, issue.2, pp.608-633, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00160849

H. Azari, D. Parks, and L. Xia, Random utility theory for social choice, Advances in Neural Information Processing Systems (NIPS), pp.126-134, 2012.

K. A. Baggerly, Visual estimation of structure in ranked data, 1995.

J. P. Barthelemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Mathematical Social Sciences, vol.1, pp.235-267, 1981.

J. J. Bartholdi, C. A. Tovey, and M. A. Trick, The computational difficulty of manipulating an election, Social Choice and Welfare, vol.6, pp.227-241, 1989.

M. Bashir, J. Anderton, J. Wu, P. B. Golbus, V. Pavlu et al., A document rating system for preference judgements, Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval, pp.909-912, 2013.

R. M. Bell and Y. Koren, Lessons from the netflix prize challenge, Acm Sigkdd Explorations Newsletter, vol.9, issue.2, pp.75-79, 2007.

A. Bellet, A. Habrard, and M. Sebban, A Survey on Metric Learning for Feature Vectors and Structured Data, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01666935

N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. Rosamond, How similarity helps to efficiently compute kemeny rankings, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, vol.1, pp.657-664, 2009.

N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. Rosamond, Computing kemeny rankings, parameterized by the average kt-distance, Proceedings of the 2nd International Workshop on Computational Social Choice, 2008.

A. Bhowmik and J. Ghosh, Letor methods for unsupervised rank aggregation, Proceedings of the 26th International Conference on World Wide Web, pp.1331-1340, 2017.

P. Binev, A. Cohen, W. Dahmen, R. Devore, and V. Temlyakov, Universal algorithms for learning theory part i: piecewise constant functions, Journal of Machine Learning Research, pp.1297-1321, 2005.

G. Blin, M. Crochemore, S. Hamel, and S. Vialette, Median of an odd number of permutations, Pure Mathematics and Applications, vol.21, issue.2, pp.161-175, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00619773

J. C. Borda, Mémoire sur les élections au scrutin, 1781.

L. Bottou and O. Bousquet, The trade-offs of large-scale learning, Advances in Neural Information Processing Systems (NIPS), pp.161-168, 2008.

S. Boucheron, O. Bousquet, and G. Lugosi, Theory of classification: A survey of some recent advances, ESAIM: probability and statistics, vol.9, pp.323-375, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00017923

R. A. Bradley and M. E. Terry, Rank analysis of incomplete block designs: I. the method of paired comparisons, Biometrika, vol.39, issue.3/4, pp.324-345, 1952.

B. Brancotte, B. Yang, G. Blin, S. Cohen-boulakia, A. Denise et al., Rank aggregation with ties: Experiments and analysis, Proceedings of the VLDB Endowment, vol.8, pp.1202-1213, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01165336

F. Brandt, M. Brill, E. Hemaspaandra, and L. A. Hemaspaandra, Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates, Journal of Artificial Intelligence Research, pp.439-496, 2015.

M. Braverman and E. Mossel, Noisy sorting without resampling, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '08, pp.268-276, 2008.

M. Braverman and E. Mossel, Sorting from noisy information, 2009.

P. B. Brazdil, C. Soares, and J. P. Da-costa, Ranking learning algorithms: Using ibl and meta-learning on accuracy and time results, Machine Learning, vol.50, issue.3, pp.251-277, 2003.

L. Breiman, Bagging predictors, Machine Learning, vol.26, pp.123-140, 1996.
DOI : 10.1007/bf00058655
URL : https://link.springer.com/content/pdf/10.1007%2FBF00058655.pdf

L. Breiman, Random forests, Machine Learning, vol.45, pp.5-32, 2001.

L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees, 1984.

R. Breitling, P. Armengaud, A. Amtmann, and P. Herzyk, Rank products: a simple, yet powerful, new method to detect differentially regulated genes in replicated microarray experiments, FEBS letters, vol.573, issue.1, pp.83-92, 2004.

S. Brin and L. Page, The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems, vol.30, pp.107-117, 1998.

C. Brouard, M. Szafranski, F. .-d'alché, and . Buc, Input output kernel regression: supervised and semisupervised structured output prediction with operator-valued kernels, Journal of Machine Learning Research, vol.17, issue.176, pp.1-48, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01216708

R. Busa-fekete, E. Hüllermeier, and A. E. Mesaoudi-paul, Preference-based online learning with dueling bandits: A survey, 2018.

R. Busa-fekete, E. Hüllermeier, and B. Szörényi, Preference-based rank elicitation using statistical models: The case of mallows, Proceedings of the 31st International Conference on Machine Learning (ICML), pp.1071-1079, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01079369

C. Calauzenes, N. Usunier, and P. Gallinari, On the (non-) existence of convex, calibrated surrogate losses for ranking, Advances in Neural Information Processing Systems (NIPS), pp.197-205, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00834050

Z. Cao, T. Qin, T. Liu, M. Tsai, and H. Li, Learning to rank: from pairwise approach to listwise approach, Proceedings of the 24th Annual International Conference on Machine learning (ICML), pp.129-136, 2007.

A. Caponnetto and E. D. Vito, Optimal rates for the regularized least-squares algorithm, Foundations of Computational Mathematics, vol.7, issue.3, pp.331-368, 2007.

B. Carterette and P. N. Bennett, Evaluation measures for preference judgments, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pp.685-686, 2008.

B. Carterette, P. N. Bennett, D. M. Chickering, and S. T. Dumais, Here or there, European Conference on Information Retrieval, pp.16-27, 2008.

V. R. Carvalho, J. L. Elsas, W. W. Cohen, and J. G. Carbonell, A meta-learning approach for robust rank learning, SIGIR 2008 workshop on learning to rank for information retrieval, vol.1, 2008.

O. Chapelle and Y. Chang, Yahoo! learning to rank challenge overview, Yahoo! Learning to Rank Challenge, pp.1-24, 2011.

S. Chen and T. Joachims, Modeling intransitivity in matchup and comparison data, Proceedings of the 9th ACM international conference on web search and data mining, pp.227-236, 2016.

X. Chen, P. N. Bennett, K. Collins-thompson, and E. Horvitz, Pairwise ranking aggregation in a crowdsourced setting, Proceedings of the sixth ACM international conference on Web search and data mining, pp.193-202, 2013.

Y. Chen and C. Suh, Spectral mle: Top-k rank aggregation from pairwise comparisons, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.371-380, 2015.

W. Cheng, J. Hühn, and E. Hüllermeier, Decision tree and instance-based learning for label ranking, Proceedings of the 26th International Conference on Machine Learning (ICML), pp.161-168, 2009.

W. Cheng and E. Hüllermeier, A new instance-based label ranking approach using the mallows model, Advances in Neural Networks-ISNN 2009, pp.707-716, 2009.

W. Cheng and E. Hüllermeier, A nearest neighbor approach to label ranking based on generalized labelwise loss minimization, 2013.

W. Cheng, E. Hüllermeier, and K. Dembczynski, Label ranking methods based on the plackett-luce model, Proceedings of the 27th International Conference on Machine Learning (ICML), pp.215-222, 2010.

T. H. Chiang, H. Y. Lo, and S. D. Lin, A ranking-based knn approach for multi-label classification, Asian Conference on Machine Learning, pp.81-96, 2012.

C. Ciliberto, L. Rosasco, and A. Rudi, A consistent regularization approach for structured prediction, Advances in Neural Information Processing Systems (NIPS), pp.4412-4420, 2016.

S. Clémençon, R. Gaudel, and J. Jakubowicz, Clustering rankings in the fourier domain, Machine Learning and Knowledge Discovery in Databases, pp.343-358, 2011.

S. Clémençon and J. Jakubowicz, Kantorovich distances between rankings with applications to rank aggregation, Machine Learning and Knowledge Discovery in Databases, pp.248-263, 2010.

S. Clémençon, A. Korba, and E. Sibony, Ranking median regression: Learning to order through local consensus, International Conference on Algorithmic Learning Theory, 2017.

W. W. Cohen, R. E. Schapire, and Y. Singer, Learning to order things, Journal of Artificial Intelligence Research, vol.10, issue.1, pp.243-270, 1999.

N. Condorcet, Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. L'imprimerie royale, p.1785

V. Conitzer, A. Davenport, and J. Kalagnanam, Improved bounds for computing kemeny rankings, Proceedings, The 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference (AAAI), vol.6, pp.620-626, 2006.

V. Conitzer, M. Rognlie, and L. Xia, Preference functions that score rankings and maximum likelihood estimation, Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), vol.9, pp.109-115, 2009.

V. Conitzer and T. Sandholm, Common voting rules as maximum likelihood estimators, Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence (UAI), pp.145-152, 2005.

V. Conitzer and T. Sandholm, Common voting rules as maximum likelihood estimators, 2012.

A. H. Copeland, A reasonable social welfare function, Seminar on applications of mathematics to social sciences, 1951.

D. Coppersmith, L. Fleischer, and A. Rudra, Ordering by weighted number of wins gives a good ranking for weighted tournaments, Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, SODA '06, pp.776-782, 2006.

D. Cornaz, L. Galand, and O. Spanjaard, Kemeny elections with bounded single-peaked or singlecrossing width, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), vol.13, pp.76-82, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01372505

C. Cortes, M. Mohri, and J. Weston, A general regression technique for learning transductions, Proceedings of the 22nd International Conference on Machine Learning (ICML), pp.153-160, 2005.

R. Coulom, Whole-history rating: A bayesian rating system for players of time-varying strength, International Conference on Computers and Games, pp.113-124, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00323349

D. E. Critchlow, M. A. Fligner, and J. S. Verducci, Probability models on rankings, Journal of Mathematical Psychology, vol.35, issue.3, pp.294-318, 1991.

M. A. Croon, Latent class models for the analysis of rankings, New Developments in Psychological Choice Modeling, vol.60, pp.99-121, 1989.

A. Davenport and J. Kalagnanam, A computational study of the kemeny rule for preference aggregation, AAAI, vol.4, pp.697-702, 2004.

A. Davenport and D. Lovell, Ranking pilots in aerobatic flight competitions, TJ Watson Research Center, 2005.

D. Davidson and J. Marschak, Experimental tests of a stochastic decision theory. Measurement: Definitions and theories, vol.17, p.274, 1959.

O. Dekel, Y. Singer, and C. D. Manning, Log-linear models for label ranking, Advances in Neural Information Processing Systems (NIPS), pp.497-504, 2004.

K. Deng, S. Han, K. J. Li, and J. S. Liu, Bayesian aggregation of order-based rank data, Journal of the American Statistical Association, vol.109, issue.507, pp.1023-1039, 2014.

M. S. Desarkar, S. Sarkar, and P. Mitra, Preference relations based unsupervised rank aggregation for metasearch, Expert Systems with Applications, vol.49, pp.86-98, 2016.

L. Devroye, L. Györfi, and G. Lugosi, A probabilistic theory of pattern recognition, 1996.

M. M. Deza and E. Deza, Encyclopedia of Distances, 2009.

P. Diaconis, Group representations in probability and statistics, 1988.

P. Diaconis, A generalization of spectral analysis with application to ranked data, The Annals of Statistics, pp.949-979, 1989.

P. Diaconis and R. L. Graham, Spearman's footrule as a measure of disarray, Journal of the Royal Statistical Society. Series B (Methodological), pp.262-268, 1977.

M. Diss and A. Doghmi, Multi-winner scoring election methods: Condorcet consistency and paradoxes, Public Choice, vol.169, issue.1-2, pp.97-116, 2016.
URL : https://hal.archives-ouvertes.fr/halshs-01285526

N. Djuric, M. Grbovic, V. Radosavljevic, N. Bhamidipati, and S. Vucetic, Non-linear label ranking for large-scale prediction of long-term user interests, AAAI, pp.1788-1794, 2014.

J. Dong, K. Yang, and Y. Shi, Ranking from crowdsourced pairwise comparisons via smoothed matrix manifold optimization, 2017 IEEE International Conference on, pp.949-956, 2017.

C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, Rank aggregation methods for the web, Proceedings of the 10th International Conference on World Wide Web, pp.613-622, 2001.

E. V. Bonilla, P. Poupart, E. Abbasnejad, and S. Sanner, Learning community-based preferences via dirichlet process mixtures of gaussian processes, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), 2013.

A. Elo, The rating of chessplayers, past and present, 1978.

R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee, Comparing and aggregating rankings with ties, Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp.47-58, 2004.

R. Fagin, R. Kumar, and D. Sivakumar, Comparing top k lists, SIAM Journal on discrete mathematics, vol.17, issue.1, pp.134-160, 2003.

M. A. Fahandar, E. Hüllermeier, and . Couso, Statistical inference for incomplete ranking data: The case of rank-dependent coarsening, Proceedings of the 34th International Conference on Machine Learning (ICML), pp.1078-1087, 2017.

M. Falahatgar, Y. Hao, A. Orlitsky, V. Pichapati, and V. Ravindrakumar, Maxing and ranking with few assumptions, Advances in Neural Information Processing Systems (NIPS), pp.7060-7070, 2017.

M. Falahatgar, A. Jain, A. Orlitsky, V. Pichapati, and V. Ravindrakumar, The limits of maxing, ranking, and preference learning, Proceedings of the 35th International Conference on Machine Learning (ICML), pp.1426-1435, 2018.

F. Farnoud, O. Milenkovic, and B. Touri, A novel distance-based approach to constrained rank aggregation, 2012.

F. Farnoud, V. Skachek, and O. Milenkovic, Rank modulation for translocation error correction, 2012 IEEE International Symposium on, pp.2988-2992, 2012.

R. Fathony, S. Behpour, X. Zhang, and B. Ziebart, Efficient and consistent adversarial bipartite matching, Proceedings of the 35th International Conference on Machine Learning (ICML), pp.1456-1465, 2018.

J. Feng, Q. Fang, and W. Ng, Discovering bucket orders from full rankings, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp.55-66, 2008.

P. C. Fishburn, Binary choice probabilities: on the varieties of stochastic transitivity, Journal of Mathematical psychology, vol.10, issue.4, pp.327-352, 1973.

M. A. Fligner and J. S. Verducci, Distance based ranking models, JRSS Series B (Methodological), vol.48, issue.3, pp.359-369, 1986.

M. A. Fligner and J. S. Verducci, Posterior probabilities for a consensus ordering, Psychometrika, vol.55, issue.1, pp.53-63, 1990.

F. Fogel, R. Jenatton, F. Bach, and A. , Convex relaxations for permutation problems, Advances in Neural Information Processing Systems (NIPS), pp.1016-1024, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00907528

L. R. Ford, Solution of a ranking problem from binary comparisons, The American Mathematical Monthly, vol.64, issue.8P2, pp.28-33, 1957.

D. Freund and D. P. Williamson, Rank aggregation: New bounds for mcx, 2015.

J. Friedman, Local learning based on recursive covering, Computing Science and Statistics, pp.123-140, 1997.

J. Friedman, T. Hastie, and R. Tibshirani, The elements of statistical learning, 2002.

J. Fürnkranz and E. Hüllermeier, Pairwise preference learning and ranking, European Conference on Machine Learning, pp.145-156, 2003.

J. Fürnkranz and E. Hüllermeier, Preference learning, 2011.

X. Geng and L. Luo, Multilabel ranking with inconsistent rankers, Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, pp.3742-3747, 2014.

A. Gionis, H. Mannila, K. Puolamäki, and A. Ukkonen, Algorithms for discovering bucket orders from data, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.561-566, 2006.

M. E. Glickman, The glicko system, 1995.

M. E. Glickman, Parameter estimation in large dynamic paired comparison experiments, Journal of the Royal Statistical Society: Series C (Applied Statistics), vol.48, issue.3, pp.377-394, 1999.

R. G. Gomes, P. Welinder, A. Krause, P. Perona, and . Crowdclustering, Advances in neural information processing systems, pp.558-566, 2011.

I. C. Gormley and T. B. Murphy, A mixture of experts model for rank data with applications in election studies, The Annals of Applied Statistics, vol.2, issue.4, pp.1452-1477, 2008.

J. Guiver and E. Snelson, Bayesian inference for plackett-luce ranking models, Proceedings of the 26th International Conference on Machine Learning (ICML), 2009.

S. Gunasekar, O. O. Koyejo, and J. Ghosh, Preference completion from partial rankings, Advances in Neural Information Processing Systems (NIPS), pp.1370-1378, 2016.

M. Gurrieri, X. Siebert, P. Fortemps, S. Greco, and R. S?owi´nskis?owi´nski, Label ranking: A new rule-based label ranking method, International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp.613-623, 2012.

L. Györfi, M. Kohler, A. Krzyzak, and H. Walk, A distribution-free theory of nonparametric regression, 2006.

B. Hajek, S. Oh, and J. Xu, Minimax-optimal inference from partial rankings, Advances in Neural Information Processing Systems (NIPS), pp.1475-1483, 2014.

W. J. Heiser and A. D'ambrosio, Clustering and prediction of rankings within a kemeny distance framework, Algorithms from and for Nature and Life, pp.19-31, 2013.

R. Herbrich, T. Minka, and T. Graepel, Trueskill TM : A bayesian skill rating system, Advances in Neural Information Processing Systems (NIPS), pp.569-576, 2006.

J. Huang, C. Guestrin, and L. Guibas, Fourier theoretic probabilistic inference over permutations, Journal of Machine Learning Research, vol.10, pp.997-1070, 2009.

E. Hüllermeier, J. Fürnkranz, W. Cheng, and K. Brinker, Label ranking by learning pairwise preferences, Artificial Intelligence, vol.172, issue.16, pp.1897-1916, 2008.

D. R. Hunter, MM algorithms for generalized bradley-terry models, Annals of Statistics, pp.384-406, 2004.

E. Irurozki, B. Calvo, and J. Lozano, Mallows and generalized mallows model for matchings, 2017.

K. G. Jamieson and R. Nowak, Active ranking using pairwise comparisons, Advances in Neural Information Processing Systems (NIPS), pp.2240-2248, 2011.

X. Jiang, L. H. Lim, Y. Yao, and Y. Ye, Statistical ranking and combinatorial Hodge theory. Mathematical Programming, vol.127, pp.203-244, 2011.

Y. Jiao, A. Korba, and E. Sibony, Controlling the distance to a kemeny consensus without computing it, Proceedings of the 33rd International Conference on Machine Learning (ICML), 2016.

Y. Jiao and J. P. Vert, The kendall and mallows kernels for permutations, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01279273

Y. Jiao and J. P. Vert, The kendall and mallows kernels for permutations, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.1935-1944, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01279273

T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay, Accurately interpreting clickthrough data as implicit feedback, ACM SIGIR Forum, vol.51, pp.4-11, 2005.
DOI : 10.1145/3130332.3130334
URL : http://www.cs.cornell.edu/People/tj/publications/joachims_etal_05a.pdf

H. Kadri, M. Ghavamzadeh, and P. Preux, A generalized kernel approach to structured output learning, Proceedings of the 30th International Conference on Machine Learning (ICML), pp.471-479, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00695631

R. Kakarala, A signal processing approach to Fourier analysis of ranking data: the importance of phase, IEEE Transactions on Signal Processing, pp.1-10, 2011.

T. Kamishima, Nantonac collaborative filtering: recommendation based on order responses, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.583-588, 2003.

T. Kamishima, H. Kazawa, and S. Akaho, A survey and empirical comparison of object ranking methods, Preference learning, pp.181-201, 2010.
DOI : 10.1007/978-3-642-14125-6_9
URL : http://www.kamishima.net/archive/2009-b-pl2.pdf

M. Karpinski and W. Schudy, Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament, Algorithms and Computation, pp.3-14, 2010.
DOI : 10.1007/978-3-642-17517-6_3

S. Katariya, L. Jain, N. Sengupta, J. Evans, and R. Nowak, Adaptive sampling for coarse ranking, Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS), 2018.

J. P. Keener, The perron-frobenius theorem and the ranking of football teams, SIAM review, vol.35, issue.1, pp.80-93, 1993.
DOI : 10.1137/1035004

J. G. Kemeny, Mathematics without numbers, Daedalus, vol.88, pp.571-591, 1959.

J. Kemeny, Mathematical models in the social sciences, 1972.

S. Kenkre, A. Khan, and V. Pandit, On discovering bucket orders from preference data, Society for Industrial and Applied Mathematics. Proceedings of the SIAM International Conference on Data Mining, p.872, 2011.
DOI : 10.1137/1.9781611972818.75
URL : https://epubs.siam.org/doi/pdf/10.1137/1.9781611972818.75

C. Kenyon-mathieu and W. Schudy, How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp.95-103, 2007.
DOI : 10.1145/1250790.1250806

A. Khetan and S. Oh, Data-driven rank breaking for efficient rank aggregation, 2016.

P. Kidwell, G. Lebanon, and W. S. Cleveland, Visualizing incomplete and partially ranked data, IEEE transactions on visualization and computer graphics, vol.14, issue.6, pp.1356-63, 2008.
DOI : 10.1109/tvcg.2008.181
URL : http://www.cc.gatech.edu/~lebanon/papers/mdsRanking.pdf

R. Kolde, S. Laur, P. Adler, and J. Vilo, Robust rank aggregation for gene list integration and metaanalysis, Bioinformatics, vol.28, issue.4, pp.573-580, 2012.
DOI : 10.1093/bioinformatics/btr709
URL : https://academic.oup.com/bioinformatics/article-pdf/28/4/573/16911737/btr709.pdf

V. Koltchinskii and O. Beznosova, Exponential convergence rates in classification, The 18th Conference on Learning Theory (COLT), 2005.
DOI : 10.1007/11503415_20

R. Kondor and M. S. Barbosa, Ranking with kernels in Fourier space, The 23rd Conference on Learning Theory (COLT), pp.451-463, 2010.

A. Korba, S. Clémençon, and E. Sibony, A learning theory of ranking aggregation, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017.

A. Korba, A. Garcia, and F. Buc-d'alché, A structured prediction approach for label ranking, 2018.

H. W. Kuhn, The hungarian method for the assignment problem, Naval Research Logistics (NRL), vol.2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109
URL : http://www.eecs.umich.edu/%7Epettie/matching/Kuhn-hungarian-assignment.pdf

V. Kuleshov and D. Precup, Algorithms for multi-armed bandit problems, 2014.

R. Kumar and S. Vassilvitskii, Generalized distances between rankings, Proceedings of the 19th international conference on World wide web, pp.571-580, 2010.

P. Kurrild-klitgaard, An empirical example of the condorcet paradox of voting in a large electorate, Public Choice, vol.107, issue.1-2, pp.135-145, 2001.

S. Lahaie and N. Shah, Neutrality and geometry of mean voting, Proceedings of the fifteenth ACM conference on Economics and computation, pp.333-350, 2014.

M. Lahiri, Bootstrapping the studentized sample mean of lattice variables, Journal of Multivariate Analysis, vol.45, pp.247-256, 1993.

T. L. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in applied mathematics, vol.6, pp.4-22, 1985.

K. W. Lam and C. H. Leung, Rank aggregation for meta-search engines, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pp.384-385, 2004.

G. Lebanon and Y. Mao, Non-parametric modeling of partially ranked data, Journal of Machine Learning Research, vol.9, pp.2401-2429, 2008.

M. Lee, M. Steyvers, M. Deyoung, and B. Miller, A model-based approach to measuring expertise in ranking tasks, Proceedings of the Annual Meeting of the Cognitive Science Society, vol.33, 2011.

P. H. Lee and P. L. Yu, Mixtures of weighted distance-based models for ranking data with applications in political studies, Computational Statistics & Data Analysis, vol.56, issue.8, pp.2486-2500, 2012.

J. Levin and B. Nalebuff, An introduction to vote-counting schemes, Journal of Economic Perspectives, vol.9, issue.1, pp.3-26, 1995.

H. Li, Learning to rank for information retrieval and natural language processing, Synthesis Lectures on Human Language Technologies, vol.7, issue.3, pp.1-121, 2014.

P. Li, A. Mazumdar, and O. Milenkovic, Efficient rank aggregation via lehmer codes, 2017.

S. W. Linderman, G. E. Mena, H. Cooper, L. Paninski, and J. P. Cunningham, Reparameterizing the birkhoff polytope for variational permutation inference, 2017.

T. Y. Liu, Learning to rank for information retrieval, Foundations and Trends in Information Retrieval, vol.3, issue.3, pp.225-331, 2009.

Y. T. Liu, T. Y. Liu, T. Qin, Z. M. Ma, and H. Li, Supervised rank aggregation, Proceedings of the 16th international conference on World Wide Web, pp.481-490, 2007.

M. Lomeli, M. Rowland, A. Gretton, and Z. Ghahramani, Antithetic and monte carlo kernel estimators for partial rankings, 2018.

T. Lu and C. Boutilier, Learning mallows models with pairwise preferences, Proceedings of the 28th International Conference on Machine Learning (ICML), pp.145-152, 2011.

T. Lu and C. Boutilier, Effective sampling and learning for mallows models with pairwise-preference data, vol.15, pp.3963-4009, 2014.

Y. Lu and S. N. Negahban, Individualized rank aggregation using nuclear norm regularization, Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on, pp.1473-1479, 2015.

R. D. Luce, Individual Choice Behavior, 1959.

G. Lugosi and A. Nobel, Consistency of data-driven histogram methods for density estimation and classification, Ann. Statist, vol.24, issue.2, pp.687-706, 1996.

J. , Second report of the irish commission on electronic voting. Voting matters, vol.23, pp.13-17, 2007.

C. L. Mallows, Non-null ranking models, Biometrika, vol.44, issue.1-2, pp.114-130, 1957.

H. Mania, A. Ramdas, M. J. Wainwright, M. I. Jordan, and B. Recht, On kernel methods for covariates that are rankings, 2016.

H. Mania, A. Ramdas, M. J. Wainwright, M. I. Jordan, and B. Recht, Universality of mallows' and degeneracy of kendall's kernels for rankings, p.25, 2016.

J. I. Marden, Analyzing and Modeling Rank Data, 1996.

M. Mare? and M. Straka, Linear-time ranking of permutations, European Symposium on Algorithms, pp.187-193, 2007.

P. Massart and E. Nédélec, Risk bounds for statistical learning, Annals of Statistics, vol.34, issue.5, 2006.

N. Mattei, J. Forshee, and J. Goldsmith, An empirical study of voting rules and manipulation with large datasets, Proceedings of COMSOC. Citeseer, 2012.

L. Maystre and M. Grossglauser, Fast and accurate inference of plackett-luce models, Advances in Neural Information Processing Systems (NIPS), pp.172-180, 2015.

L. Maystre and M. Grossglauser, Just sort it! a simple and effective approach to active preference learning, Proceedings of the 34th International Conference on Machine Learning (ICML), 2017.

D. Mcfadden, Conditional logit analysis of qualitative choice behavior, Frontiers in Econometrics, pp.105-142, 1974.

M. Meila and L. Bao, An exponential model for infinite rankings, Journal of Macine Learning Research, vol.11, pp.3481-3518, 2010.

M. Meila and H. Chen, Dirichlet process mixtures of generalized mallows models, Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI), pp.358-367, 2010.

M. Meila, K. Phadnis, A. Patterson, and J. Bilmes, Consensus ranking under the exponential model, Proceedings of UAI'07, pp.729-734, 2007.

V. R. Merlin and D. G. Saari, Copeland method ii: Manipulation, monotonicity, and paradoxes, Journal of Economic Theory, vol.72, issue.1, pp.148-172, 1997.

C. A. Micchelli and M. Pontil, Learning the kernel function via regularization, Journal of machine learning research, vol.6, pp.1099-1125, 2005.

S. Mohajer, C. Suh, and A. Elmahdy, Active learning for top-k rank aggregation from noisy comparisons, Proceedings of the 34th International Conference on Machine Learning (ICML), pp.2488-2497, 2017.

T. B. Murphy and D. Martin, Mixtures of distance-based models for ranking data, Computational statistics & data analysis, vol.41, issue.3, pp.645-655, 2003.

W. Myrvold and F. Ruskey, Ranking and unranking permutations in linear time, Information Processing Letters, vol.79, issue.6, pp.281-284, 2001.

S. Negahban, S. Oh, and D. Shah, Iterative ranking from pair-wise comparisons, Advances in Neural Information Processing Systems (NIPS), pp.2474-2482, 2012.

S. Negahban, S. Oh, and D. Shah, Rank centrality: Ranking from pairwise comparisons, Operations Research, vol.65, issue.1, pp.266-287, 2016.

S. Niu, J. Guo, Y. Lan, and X. Cheng, Top-k learning to rank: labeling, ranking and evaluation, Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, pp.751-760, 2012.

S. Niu, Y. Lan, J. Guo, and X. Cheng, Stochastic rank aggregation, Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI), pp.478-487, 2013.

S. Niu, Y. Lan, J. Guo, S. Wan, and X. Cheng, Which noise affects algorithm robustness for learning to rank, Information Retrieval Journal, vol.18, issue.3, pp.215-245, 2015.

S. Nowozin and C. H. Lampert, Structured learning and prediction in computer vision, Foundations and Trends in Computer Graphics and Vision, vol.6, issue.3-4, pp.185-365, 2011.

A. Osokin, F. R. Bach, and S. Lacoste-julien, On structured prediction theory with calibrated convex surrogate losses, Advances in Neural Information Processing Systems (NIPS), pp.301-312, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01611691

A. Pananjady, C. Mao, V. Muthukumar, M. J. Wainwright, and T. A. Courtade, Worst-case vs averagecase design for estimation from fixed pairwise comparisons, 2017.

D. Park, J. Neeman, J. Zhang, S. Sanghavi, and I. Dhillon, Preference completion: Large-scale collaborative ranking from pairwise comparisons, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.1907-1916, 2015.

T. Patel, D. Telesca, R. Rallo, S. George, T. Xia et al., Hierarchical rank aggregation with applications to nanotoxicology, Journal of Agricultural, Biological, and Environmental Statistics, vol.18, issue.2, pp.159-177, 2013.

R. L. Plackett, The analysis of permutations, Applied Statistics, vol.2, issue.24, pp.193-202, 1975.

S. Plis, S. Mccracken, T. Lane, and V. Calhoun, Directional statistics on permutations, Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS), pp.600-608, 2011.

A. Popova, The robust beauty of apa presidential elections: an empty-handed hunt for the social choice conundrum, 2012.

A. Prasad, H. Pareek, and P. Ravikumar, Distributional rank aggregation, and an axiomatic analysis, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.2104-2112, 2015.

A. D. Procaccia, S. J. Reddi, and N. Shah, A maximum likelihood approach for selecting sets of alternatives, 2012.

L. Qian, J. Gao, and H. Jagadish, Learning user preferences by adaptive pairwise comparison, Proceedings of the VLDB Endowment, vol.8, pp.1322-1333, 2015.

T. Qin, X. Geng, and T. Y. Liu, A new probabilistic model for rank aggregation, Advances in Neural Information Processing Systems (NIPS), pp.1948-1956, 2010.

S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, 1991.

F. Radlinski and T. Joachims, Query chains: learning to rank from implicit feedback, Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp.239-248, 2005.

F. Radlinski and T. Joachims, Active exploration for learning rankings from clickthrough data, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.570-579, 2007.

A. Rajkumar and S. Agarwal, A statistical convergence perspective of algorithms for rank aggregation from pairwise data, Proceedings of the 31st International Conference on Machine Learning (ICML), pp.118-126, 2014.

A. Rajkumar and S. Agarwal, When can we rank well from comparisons of o(nlog(n)) non-actively chosen pairs, The 29th Conference on Learning Theory (COLT), pp.1376-1401, 2016.

A. Rajkumar, S. Ghoshal, L. H. Lim, and S. Agarwal, Ranking from stochastic pairwise preferences: Recovering condorcet winners and tournament solution sets at the top, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.665-673, 2015.

S. Y. Ramamohan, A. Rajkumar, and S. Agarwal, Dueling bandits: Beyond condorcet winners to general tournament solutions, Advances in Neural Information Processing Systems (NIPS), pp.1253-1261, 2016.

K. Raman and T. Joachims, Methods for ordinal peer grading, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.1037-1046, 2014.

H. G. Ramaswamy, S. Agarwal, and A. Tewari, Convex calibrated surrogates for low-rank loss matrices with applications to subset ranking losses, Advances in Neural Information Processing Systems (NIPS), pp.1475-1483, 2013.

M. E. Renda and U. Straccia, Web metasearch: rank vs. score based rank aggregation methods, Proceedings of the 2003 ACM symposium on Applied computing, pp.841-846, 2003.

S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-thieme, Bpr: Bayesian personalized ranking from implicit feedback, Proceedings of the 25th conference on uncertainty in artificial intelligence, pp.452-461, 2009.

M. Risse, Why the count de borda cannot beat the marquis de condorcet, Social Choice and Welfare, vol.25, issue.1, pp.95-113, 2005.

C. R. Sá, P. Azevedo, C. Soares, A. M. Jorge, and A. Knobbe, Preference rules for label ranking: Mining patterns in multi-target relations. Information Fusion, vol.40, pp.112-125, 2018.

C. R. Sá, C. M. Soares, A. Knobbe, and P. Cortez, Label ranking forests. Expert Systems-The Journal of Knowledge Engineering, 2017.

D. G. Saari and V. R. Merlin, A geometric examination of kemeny's rule, Social Choice and Welfare, vol.17, issue.3, pp.403-438, 2000.

A. Saha and A. Gopalan, Battle of bandits, 2018.

F. Schalekamp and A. Van-zuylen, Rank aggregation: Together we're strong, Proceedings of the Meeting on Algorithm Engineering & Expermiments, pp.38-51, 2009.

D. Sculley, Rank aggregation for similar items, Proceedings of the 2007 SIAM international conference on data mining, pp.587-592, 2007.

J. Sese and S. Morishita, Rank aggregation method for biological databases, Genome Informatics, vol.12, pp.506-507, 2001.

N. B. Shah, S. Balakrishnan, A. Guntuboyina, and M. J. Wainright, Stochastically transitive models for pairwise comparisons: Statistical and computational issues, IEEE Transactions on Information Theory, 2017.

N. B. Shah, S. Balakrishnan, and M. J. Wainwright, Feeling the bern: Adaptive estimators for bernoulli probabilities of pairwise comparisons, IEEE International Symposium on, pp.1153-1157, 2016.

N. B. Shah, J. K. Bradley, A. Parekh, M. Wainwright, and K. Ramchandran, A case for ordinal peerevaluation in moocs, NIPS Workshop on Data Driven Education, pp.1-8, 2013.

N. B. Shah, A. Parekh, S. Balakrishnan, K. Ramchandran, J. Bradley et al., Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence, Proceedings of the 18th International Conference on Artificial Intelligence and Statistics (AISTATS), pp.856-865, 2015.

N. B. Shah and M. J. Wainwright, Simple, robust and optimal ranking from pairwise comparisons, Journal of Machine Learning Research, 2017.

E. Sibony, Borda count approximation of kemeny's rule and pairwise voting inconsistencies, NIPS2014 Workshop on Analysis of Rank Data: Confluence of Social Choice, Operations Research, and Machine Learning, 2014.

E. Sibony, S. Clemencon, and J. Jakubowicz, Multiresolution analysis of incomplete rankings with applications to prediction, 2014 IEEE International Conference on, pp.88-95, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01285707

E. Sibony, S. Clemençon, and J. Jakubowicz, Mra-based statistical learning from incomplete rankings, Proceedings of the 32nd International Conference on Machine Learning (ICML), pp.1432-1441, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01270543

H. A. Soufiani, W. Chen, D. C. Parkes, and L. Xia, Generalized method-of-moments for rank aggregation, Advances in Neural Information Processing Systems (NIPS), pp.2706-2714, 2013.

H. A. Soufiani, D. C. Parkes, and L. Xia, Computing parametric ranking models via rank-breaking, Proceedings of The 31st International Conference on Machine Learning (ICML). International Conference on Machine Learning, 2014.

H. A. Soufiani, D. C. Parkes, and L. Xia, A statistical decision-theoretic framework for social choice, Advances in Neural Information Processing Systems (NIPS), pp.3185-3193, 2014.

R. P. Stanley, Enumerative Combinatorics, pp.0-534, 1986.

I. Steinwart and A. Christmann, Support Vector Machines, 2008.

X. Su and T. M. Khoshgoftaar, A survey of collaborative filtering techniques, Advances in artificial intelligence, 2009.

Y. Sui, V. Zhuang, J. W. Burdick, and Y. Yue, Multi-dueling bandits with dependent arms, 2017.

Y. Sui, M. Zoghi, K. Hofmann, and Y. Yue, Advancements in dueling bandits, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pp.5502-5510, 2018.

M. Sun, G. Lebanon, and P. Kidwell, Estimating probabilities in recommendation systems, Journal of the Royal Statistical Society: Series C (Applied Statistics), vol.61, issue.3, pp.471-492, 2012.

B. Szörényi, R. Busa-fekete, A. Paul, and E. Hüllermeier, Online rank elicitation for plackett-luce: A dueling bandits approach, Advances in Neural Information Processing Systems (NIPS), pp.604-612, 2015.

G. L. Thompson, Generalized permutation polytopes and exploratory graphical methods for ranked data, The Annals of Statistics, pp.1401-1430, 1993.

L. L. Thurstone, A law of comparative judgment, Psychological Review, vol.34, issue.4, pp.273-286, 1927.

M. Truchon, An extension of the condorcet criterion and kemeny orders, Cahier, p.9813, 1998.

M. Truchon, Borda and the maximum likelihood approach to vote aggregation, Mathematical Social Sciences, vol.55, issue.1, pp.96-102, 2008.

G. Tsoumakas, I. Katakis, and I. Vlahavas, Mining multi-label data, Data mining and knowledge discovery handbook, pp.667-685, 2009.

A. B. Tsybakov, Optimal aggregation of classifiers in statistical learning, Annals of Statistics, vol.32, issue.1, pp.135-166, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00102142

A. B. Tsybakov, Introduction to nonparametric estimation. revised and extended from the 2004 french original, 2009.

A. Tversky, Elimination by aspects: A theory of choice, Psychological review, vol.79, issue.4, p.281, 1972.

A. Ukkonen, Clustering algorithms for chains, Journal of Machine Learning Research, vol.12, pp.1389-1423, 2011.

A. Ukkonen, K. Puolamäki, A. Gionis, and H. Mannila, A randomized approximation algorithm for computing bucket orders, Information Processing Letters, vol.109, issue.7, pp.356-359, 2009.

A. W. Van-der, J. A. Vaart, and . Wellner, Weak convergence, Weak convergence and empirical processes, pp.16-28, 1996.

A. Van-zuylen and D. P. Williamson, Deterministic algorithms for rank aggregation and other ranking and clustering problems, Approximation and Online Algorithms, pp.260-273, 2007.

V. N. Vapnik, The Nature of Statistical Learning Theory. Lecture Notes in Statistics, 2000.

S. Vembu and T. Gärtner, Label ranking algorithms: A survey, Preference learning, pp.45-64, 2010.

D. Wang, A. Mazumdar, and G. W. Wornell, A rate-distortion theory for permutation spaces, Information Theory Proceedings (ISIT), pp.2562-2566, 2013.

D. Wang, A. Mazumdar, and G. W. Wornell, Compression in the space of permutations, IEEE Transactions on Information Theory, vol.61, issue.12, pp.6417-6431, 2015.

Q. Wang, O. Wu, W. Hu, J. Yang, and W. Li, Ranking social emotions by learning listwise preference, Pattern Recognition (ACPR), 2011 First Asian Conference on, pp.164-168, 2011.

F. Wauthier, M. Jordan, and N. Jojic, Efficient ranking from pairwise comparisons, Proceedings of the 30th International Conference on Machine Learning (ICML), pp.109-117, 2013.

L. Wu, C. J. Hsieh, and J. Sharpnack, Large-scale collaborative ranking in near-linear time, Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.515-524, 2017.

O. Wu, Q. You, X. Mao, F. Xia, F. Yuan et al., Listwise learning to rank by exploring structure of objects, IEEE Trans. Knowl. Data Eng, vol.28, issue.7, pp.1934-1939, 2016.

F. Xia, T. Y. Liu, J. Wang, W. Zhang, and H. Li, Listwise approach to learning to rank: theory and algorithm, Proceedings of the 25th international conference on Machine learning, pp.1192-1199, 2008.

L. Xia, Generalized decision scoring rules: Statistical, computational, and axiomatic properties, Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, pp.661-678, 2015.

L. Xia and V. Conitzer, A maximum likelihood approach towards aggregating partial orders, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), vol.22, p.446, 2011.

S. Yasutake, K. Hatano, S. Kijima, E. Takimoto, and M. Takeda, Online linear optimization over permutations, International Symposium on Algorithms and Computation, pp.534-543, 2011.

J. I. Yellott, The relationship between luce's choice axiom, thurstone's theory of comparative judgment, and the double exponential distribution, Journal of Mathematical Psychology, vol.15, issue.2, pp.109-144, 1977.

J. Yi, R. Jin, S. Jain, and A. Jain, Inferring users' preferences from crowdsourced pairwise comparisons: A matrix completion approach, First AAAI Conference on Human Computation and Crowdsourcing, 2013.

H. P. Young, Condorcet's theory of voting, American Political Science Review, vol.82, issue.4, pp.1231-1244, 1988.

H. P. Young and A. Levenglick, A consistent extension of condorcet's election principle, SIAM Journal on applied Mathematics, vol.35, issue.2, pp.285-300, 1978.

P. L. Yu, K. F. Lam, and M. Alvo, Nonparametric rank test for independence in opinion surveys, Australian Journal of Statistics, vol.31, pp.279-290, 2002.

P. L. Yu, W. M. Wan, and P. H. Lee, Preference Learning, chapter Decision tree modelling for ranking data, pp.83-106, 2010.

Y. Yue, J. Broder, R. Kleinberg, and T. Joachims, The k-armed dueling bandits problem, Journal of Computer and System Sciences, vol.78, issue.5, pp.1538-1556, 2012.

H. Zamani, A. Shakery, and P. Moradi, Regression and learning to rank aggregation for user engagement evaluation, Proceedings of the 2014 Recommender Systems Challenge, p.29, 2014.

M. L. Zhang and Z. H. Zhou, Ml-knn: A lazy learning approach to multi-label learning. Pattern recognition, vol.40, pp.2038-2048, 2007.

Z. Zhao, P. Piech, and L. Xia, Learning mixtures of plackett-luce models, Proceedings of the 33nd International Conference on Machine Learning (ICML), pp.2906-2914, 2016.

Y. Zhou, Y. Liu, J. Yang, X. He, and L. Liu, A taxonomy of label ranking algorithms, JCP, vol.9, issue.3, pp.557-565, 2014.

Y. Zhou and G. Qiu, Random forest for label ranking, 2016.

W. S. Zwicker, Consistency without neutrality in voting rules: When is a vote an average? Mathematical and Computer Modelling, vol.48, pp.1357-1373, 2008.