University rankings from the revealed preferences of the applicants
arXiv:1810.04087 · doi:10.1016/j.ejor.2020.03.008
Abstract
A methodology is presented to rank universities on the basis of the lists of programmes the students applied for. We exploit a crucial feature of the centralised assignment system to higher education in Hungary: a student is admitted to the first programme where the score limit is achieved. This makes it possible to derive a partial preference order of each applicant. Our approach integrates the information from all students participating in the system, is free of multicollinearity among the indicators, and contains few ad hoc parameters. The procedure is implemented to rank faculties in the Hungarian higher education between 2001 and 2016. We demonstrate that the ranking given by the least squares method has favourable theoretical properties, is robust with respect to the aggregation of preferences, and performs well in practice. The suggested ranking is worth considering as a reasonable alternative to the standard composite indices.
arXiv comment38 pages, 4 figures, 8 tables
References in corpus (12)
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- On the ranking of a Swiss system chess team tournament
- The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
- A characterization of the Logarithmic Least Squares Method
- University rankings from the revealed preferences of the applicants
- Characterization of the row geometric mean ranking with a group consensus axiom
- A graph interpretation of the least squares ranking method
- An alternative quality of life ranking on the basis of remittances
- Incomplete pairwise comparison matrices and weighting methods
- Preference fusion when the number of alternatives exceeds two: indirect scoring procedures
- Some impossibilities of ranking in generalized tournaments
- An impossibility theorem for paired comparisons
Cited by in corpus (6)
- University rankings from the revealed preferences of the applicants
- Axiomatizations of inconsistency indices for triads
- Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
- An alternative quality of life ranking on the basis of remittances
- Coronavirus and sports leagues: obtaining a fair ranking when the season cannot resume
- Inconsistency thresholds for incomplete pairwise comparison matrices