# zbMATH — the first resource for mathematics

Axioms for centrality scoring with principal eigenvectors. (English) Zbl 1391.91082
Summary: Techniques based on using principal eigenvector decomposition of matrices representing binary relations of sets of alternatives are commonly used in social sciences, bibliometrics, and web search engines. By representing the binary relations as a directed graph the question of ranking or scoring the alternatives can be turned into the relevant question of how to score the nodes of the graph. This paper characterizes the principal eigenvector of a matrix as a scoring function with a set of axioms. Furthermore, a method of assessing individual and group centralities simultaneously is characterized by a set of axioms. A special case of this method is the hyperlink-induced topic search for ranking websites. In general, the method can be applied to aggregation of preferences or judgments to obtain a collective assessment of alternatives.

##### MSC:
 91B14 Social choice 15A18 Eigenvalues, singular values, and eigenvectors
Full Text:
##### References:
 [1] Altman A, Tennenholtz M (2005) Ranking systems: the PageRank axioms. In: Proceedings of the 6th ACM conference on Electronic commerce (EC-05). ACM Press, New York, pp 1-8 [2] Austen-Smith, D; Banks, J, Information aggregation, rationality, and the Condorcet jury theorem, Am Polit Sci Rev, 90, 34-45, (1996) [3] Bonacich, P, Simultaneous group and individual centralities, Soc Netw, 13, 155-168, (1991) [4] Borm, P; Brink, R; Slikker, M, An iterative procedure for evaluating digraph competitions, Ann Oper Res, 109, 61-75, (2002) · Zbl 1007.91003 [5] Bozbay, I; Dietrich, FK; Peters, HJM, Judgment aggregation in search for the truth, Games Econ Behav, 87, 571-590, (2014) · Zbl 1302.91074 [6] Brin, S; Page, L, The anatomy of a large-scale hypertextual web search engine, Comput Netw ISDN Syst, 30, 107-117, (1998) [7] Cvetković D, Rowlinson P, Simić S (1997) Eigenspaces of graphs. Cambridge University Press, Cambridge · Zbl 0878.05057 [8] David, HA, Ranking from unbalanced paired-comparison data, Biometrika, 74, 432-436, (1987) · Zbl 0618.62077 [9] David HA (1988) The method of paired comparisons, 2nd edn. Charles Griffin and Company, London · Zbl 0665.62075 [10] Echenique, F; Fryer, RG, A measure of segregation based on social interactions, Q J Econ, 122, 441-485, (2007) [11] Feddersen, T; Pesendorfer, W, Information aggregation and voting behaviour in elections, Econometrica, 65, 1029-1058, (1997) · Zbl 0898.90050 [12] Henriet, D, The copeland choice function: an axiomatic characterization, Soc Choice Welf, 2, 49-63, (1985) · Zbl 0602.90010 [13] Herings, JJ; Laan, G; Talman, D, The positional power of nodes in digraphs, Soc Choice Welf, 24, 439-454, (2005) · Zbl 1088.90505 [14] Hu, X; Shapley, LS, On authority distributions in organizations: equilibrium, Games Econ Behav, 45, 132-152, (2003) · Zbl 1054.91011 [15] Kleinberg, JM, Authoritative sources in a hyperlinked environment, J ACM, 46, 604-632, (1999) · Zbl 1065.68660 [16] Laslier J-F (1997) Tournament solutions and majority voting. Springer, Berlin, Heidelberg, New York · Zbl 0948.91504 [17] List C, Pettit P (2011) Group agency: the possibility, design and status of corporate agents. Oxford University Press, Oxford [18] Meyer CD (2000) Matrix analysis and applied linear algebra. SIAM, Philadelphia [19] Palacios-Huerta, I; Volij, O, The measurement of intellectual influence, Econometrica, 72, 963-977, (2004) · Zbl 1137.91582 [20] Rubinstein, A, Ranking the participants in a tournament, SIAM J Appl Math, 38, 108-111, (1980) · Zbl 0442.05028 [21] Slutzki, G; Volij, O, Ranking participants in generalized tournaments, Int J Game Theory, 33, 255-270, (2005) · Zbl 1071.91014 [22] Slutzki, G; Volij, O, Scoring of webpages and tournaments—axiomatizations, Soc Choice Welf, 26, 75-92, (2006) · Zbl 1132.91418 [23] Brink, R; Gilles, RP, Measuring domination in directed networks, Soc Netw, 22, 141-157, (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.