Abstract
We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships specified by a directed graph may reflect the outcomes of a sport competition, the mutual reference structure between websites, or a group preference structure over alternatives. We introduce a class of scoring methods for directed graphs, indexed by a single nonnegative parameter α. This parameter reflects the internal slackening of a node within an underlying iterative process. The class of so-called internal slackening scoring methods, denoted by λα, consists of the limits of these processes. It is seen that λ0 extends the invariant scoring method, while λ∞ extends the fair bets scoring method. Method λ1 corresponds with the existing λ-scoring method of Borm et al. (Ann Oper Res 109(1):61–75, 2002) and can be seen as a compromise between λ0 and λ∞. In particular, an explicit proportionality relation between λα and λ1 is derived. Moreover, the internal slackening scoring methods are applied to the setting of social choice situations where they give rise to a class of social choice correspondences that refine both the Top cycle correspondence and the Uncovered set correspondence.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Berger M. (1993) An Introduction to Probability and Stochastic Processes. Springer, New York
Borm P., van den Brink R., Levinsky R., Slikker M. (2004) On two new social choice correspondences. Mathematical Social Sciences 47(1): 51–68
Borm P., van den Brink R., Slikker M. (2002) An iterative procedure for evaluating digraph competitions. Annals of Operations Research 109(1): 61–75
Daniels H. (1969) Round-robin tournament scores. Biometrika 56(2): 295–299
Fishburn P. (1977) Condorcet social choice functions. SIAM Journal on Applied Maths 33(3): 469–489
Kendall M. (1955) Further contributions to the theory of paired comparisons. Biometrics 11: 80–93
Laslier J. (1997) Tournament Solutions and Majority Voting. Springer, Berlin
Moon J., Pullman N. (1970) On generalized tournament matrices. SIAM Review 12: 384–399
Schwartz T. (1990) Cyclic tournaments and cooperative majority voting: a solution. Social Choice and Welfare 7: 19–29
Slutzki G., Volij O. (2006) Scoring of web pages and tournaments—axiomatizations. Social Choice and Welfare 26: 75–92
van den Brink R., Borm P. (2002) Digraph competitions and cooperative games. Theory and Decision 53: 327–342
van den Brink R., Gilles R. (2000) Measuring domination in directed networks. Social Networks 22: 141–157
Wei, T. (1952). The algebraic foundation of ranking theory. Ph.d. Thesis, Cambridge: Cambridge University.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Slikker, M., Borm, P. & van den Brink, R. Internal slackening scoring methods. Theory Decis 72, 445–462 (2012). https://doi.org/10.1007/s11238-011-9281-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11238-011-9281-4