Application of PageRank algorithm on sorting problem

DOI

10.2991/icmmse-16.2016.69How to use a DOI?

Keywords

PageRank, Tournament, Random matrix, Eigenvector

Abstract

In the social life, people often face a wide range of scheduling problems, such as appraisal of excellence, race rankings. These are often hot and sensitive issues, so the research of this type of problems has practical and economic value. But due to socio-cultural diversity and pluralism of values, sorting problems would be restricted on a set of priority level or justice principles. As well-known Arrow theory told us: in a certain sense, there are not a set of the justice axiom to satisfy the so called sort rules. This article is stimulated by Google's PageRank algorithm and the example of national college mathematical modeling contest problem B in 1993. Constructing random matrix shows the application of PageRank algorithm on sorting problem.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Su Weijun
PY  - 2016/03
DA  - 2016/03
TI  - Application of PageRank algorithm on sorting problem
BT  - Proceedings of the 2016 International Conference on Mechanics, Materials and Structural Engineering
PB  - Atlantis Press
SP  - 414
EP  - 419
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmmse-16.2016.69
DO  - 10.2991/icmmse-16.2016.69
ID  - Weijun2016/03
ER  -